TSTP Solution File: RNG109+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG109+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 20:26:57 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 130 ( 60 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 135 ( 37 ~; 44 |; 43 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 19 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X2 ) )
=> ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 ) )
=> ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
& X1 != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mCancel,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( sdtasdt0(X1,X2) = sz00
=> ( X1 = sz00
| X2 = sz00 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCancel) ).
fof(m__2203,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xa )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xb )
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2203) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddZero) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2091) ).
fof(m__2110,hypothesis,
( xa != sz00
| xb != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2110) ).
fof(c_0_6,negated_conjecture,
~ ? [X1] :
( ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X2 ) )
=> ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 ) )
=> ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
& X1 != sz00 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| sdtasdt0(X3,X4) != sz00
| X3 = sz00
| X4 = sz00 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCancel])]) ).
fof(c_0_8,hypothesis,
( aElement0(esk8_0)
& sdtasdt0(xa,esk8_0) = sz00
& aElementOf0(sz00,slsdtgt0(xa))
& aElement0(esk9_0)
& sdtasdt0(xa,esk9_0) = xa
& aElementOf0(xa,slsdtgt0(xa))
& aElement0(esk10_0)
& sdtasdt0(xb,esk10_0) = sz00
& aElementOf0(sz00,slsdtgt0(xb))
& aElement0(esk11_0)
& sdtasdt0(xb,esk11_0) = xb
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__2203])])])]) ).
fof(c_0_9,negated_conjecture,
! [X4,X5,X5,X7,X8,X8,X10,X11,X12] :
( ( aElement0(esk12_2(X4,X5))
| ~ aElementOf0(X5,slsdtgt0(xa))
| X4 = sz00 )
& ( sdtasdt0(xa,esk12_2(X4,X5)) = X5
| ~ aElementOf0(X5,slsdtgt0(xa))
| X4 = sz00 )
& ( ~ aElement0(X7)
| sdtasdt0(xa,X7) != X5
| aElementOf0(X5,slsdtgt0(xa))
| X4 = sz00 )
& ( aElement0(esk13_2(X4,X8))
| ~ aElementOf0(X8,slsdtgt0(xb))
| X4 = sz00 )
& ( sdtasdt0(xb,esk13_2(X4,X8)) = X8
| ~ aElementOf0(X8,slsdtgt0(xb))
| X4 = sz00 )
& ( ~ aElement0(X10)
| sdtasdt0(xb,X10) != X8
| aElementOf0(X8,slsdtgt0(xb))
| X4 = sz00 )
& ( ~ aElementOf0(X11,slsdtgt0(xa))
| ~ aElementOf0(X12,slsdtgt0(xb))
| sdtpldt0(X11,X12) != X4
| X4 = sz00 )
& ( ~ aElementOf0(X4,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| X4 = sz00 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])]) ).
fof(c_0_10,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aElement0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aElement0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
cnf(c_0_11,plain,
( X1 = sz00
| X2 = sz00
| sdtasdt0(X2,X1) != sz00
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
sdtasdt0(xb,esk10_0) = sz00,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_14,hypothesis,
aElement0(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( X1 = sz00
| sdtpldt0(X2,X3) != X1
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
aElementOf0(sz00,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,hypothesis,
( xb != sz00
| xa != sz00 ),
inference(split_conjunct,[status(thm)],[m__2110]) ).
cnf(c_0_21,hypothesis,
( xb = sz00
| sz00 = esk10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_22,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])])]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xa,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_25,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_19])])]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,hypothesis,
( sz00 = esk10_0
| xa != sz00 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,hypothesis,
xa = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,hypothesis,
xb = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_13])]) ).
cnf(c_0_30,hypothesis,
sz00 = esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_29])]),c_0_28]),c_0_30]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : RNG109+4 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon May 30 17:32:10 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.024 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 32
% 0.22/1.40 # Proof object clause steps : 21
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 6
% 0.22/1.40 # Proof object clause conjectures : 3
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 13
% 0.22/1.40 # Proof object initial formulas used : 6
% 0.22/1.40 # Proof object generating inferences : 6
% 0.22/1.40 # Proof object simplifying inferences : 21
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 44
% 0.22/1.40 # Removed by relevancy pruning/SinE : 15
% 0.22/1.40 # Initial clauses : 135
% 0.22/1.40 # Removed in clause preprocessing : 2
% 0.22/1.40 # Initial clauses in saturation : 133
% 0.22/1.40 # Processed clauses : 171
% 0.22/1.40 # ...of these trivial : 4
% 0.22/1.40 # ...subsumed : 7
% 0.22/1.40 # ...remaining for further processing : 159
% 0.22/1.40 # Other redundant clauses eliminated : 32
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 2
% 0.22/1.40 # Backward-rewritten : 88
% 0.22/1.40 # Generated clauses : 966
% 0.22/1.40 # ...of the previous two non-trivial : 923
% 0.22/1.40 # Contextual simplify-reflections : 2
% 0.22/1.40 # Paramodulations : 923
% 0.22/1.40 # Factorizations : 1
% 0.22/1.40 # Equation resolutions : 42
% 0.22/1.40 # Current number of processed clauses : 69
% 0.22/1.40 # Positive orientable unit clauses : 13
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 0
% 0.22/1.40 # Non-unit-clauses : 56
% 0.22/1.40 # Current number of unprocessed clauses: 194
% 0.22/1.40 # ...number of literals in the above : 832
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 90
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2012
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 743
% 0.22/1.40 # Non-unit clause-clause subsumptions : 9
% 0.22/1.40 # Unit Clause-clause subsumption calls : 65
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 3
% 0.22/1.40 # BW rewrite match successes : 3
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 21885
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.065 s
% 0.22/1.40 # System time : 0.005 s
% 0.22/1.40 # Total time : 0.070 s
% 0.22/1.40 # Maximum resident set size: 4296 pages
%------------------------------------------------------------------------------