TSTP Solution File: RNG106+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG106+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:56 EDT 2022
% Result : Theorem 0.16s 1.34s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 194 ( 26 equ)
% Maximal formula atoms : 33 ( 6 avg)
% Number of connectives : 269 ( 104 ~; 111 |; 43 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-3 aty)
% Number of variables : 53 ( 5 sgn 28 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1,X2,X3] :
( ( aElementOf0(X1,slsdtgt0(xc))
& aElementOf0(X2,slsdtgt0(xc))
& aElement0(X3) )
=> ? [X4] :
( aElement0(X4)
& sdtasdt0(xc,X4) = X1
& ? [X5] :
( aElement0(X5)
& sdtasdt0(xc,X5) = X2
& sdtpldt0(X1,X2) = sdtasdt0(xc,sdtpldt0(X4,X5))
& sdtasdt0(X3,X1) = sdtasdt0(xc,sdtasdt0(X4,X3))
& aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
& aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)) ) ) )
=> aIdeal0(slsdtgt0(xc)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefIdeal) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1905) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPrIdeal) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1,X2,X3] :
( ( aElementOf0(X1,slsdtgt0(xc))
& aElementOf0(X2,slsdtgt0(xc))
& aElement0(X3) )
=> ? [X4] :
( aElement0(X4)
& sdtasdt0(xc,X4) = X1
& ? [X5] :
( aElement0(X5)
& sdtasdt0(xc,X5) = X2
& sdtpldt0(X1,X2) = sdtasdt0(xc,sdtpldt0(X4,X5))
& sdtasdt0(X3,X1) = sdtasdt0(xc,sdtasdt0(X4,X3))
& aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
& aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)) ) ) )
=> aIdeal0(slsdtgt0(xc)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X6,X7,X8] :
( ( aElement0(esk1_3(X6,X7,X8))
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( sdtasdt0(xc,esk1_3(X6,X7,X8)) = X6
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( aElement0(esk2_3(X6,X7,X8))
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( sdtasdt0(xc,esk2_3(X6,X7,X8)) = X7
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( sdtpldt0(X6,X7) = sdtasdt0(xc,sdtpldt0(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)))
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( sdtasdt0(X8,X6) = sdtasdt0(xc,sdtasdt0(esk1_3(X6,X7,X8),X8))
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( aElementOf0(sdtpldt0(X6,X7),slsdtgt0(xc))
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ( aElementOf0(sdtasdt0(X8,X6),slsdtgt0(xc))
| ~ aElementOf0(X6,slsdtgt0(xc))
| ~ aElementOf0(X7,slsdtgt0(xc))
| ~ aElement0(X8) )
& ~ aIdeal0(slsdtgt0(xc)) ),
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_4])])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X6,X7,X4] :
( ( aSet0(X4)
| ~ aIdeal0(X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( aElementOf0(esk3_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk5_1(X4))
| aElementOf0(esk4_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4)
| aElementOf0(esk4_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk5_1(X4))
| ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4)
| ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) ) ),
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)],[mDefIdeal])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( aElementOf0(sdtpldt0(X3,X2),slsdtgt0(xc))
| ~ aElement0(X1)
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X3,slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( aSet0(X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk6_3(X5,X6,X7))
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk6_3(X5,X6,X7)) = X7
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7
| aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElementOf0(esk7_2(X5,X6),X6)
| ~ aElement0(X11)
| sdtasdt0(X5,X11) != esk7_2(X5,X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk8_2(X5,X6))
| aElementOf0(esk7_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk8_2(X5,X6)) = esk7_2(X5,X6)
| aElementOf0(esk7_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) ) ),
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)],[mDefPrIdeal])])])])])])]) ).
cnf(c_0_10,plain,
( aIdeal0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sdtpldt0(esk3_1(X1),esk4_1(X1)),X1)
| ~ aElementOf0(sdtasdt0(esk5_1(X1),esk3_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X1,slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ aIdeal0(slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X3),slsdtgt0(xc))
| ~ aElement0(X1)
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X3,slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( aIdeal0(X1)
| aElementOf0(esk3_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( aSet0(X2)
| ~ aElement0(X1)
| X2 != slsdtgt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( aIdeal0(X1)
| aElement0(esk5_1(X1))
| ~ aSet0(X1)
| ~ aElementOf0(sdtpldt0(esk3_1(X1),esk4_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(sdtasdt0(esk5_1(slsdtgt0(xc)),esk3_1(slsdtgt0(xc))),slsdtgt0(xc))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk4_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,plain,
( aIdeal0(X1)
| aElementOf0(esk4_1(X1),X1)
| ~ aSet0(X1)
| ~ aElementOf0(sdtasdt0(esk5_1(X1),esk3_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_20,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
( aElement0(esk5_1(slsdtgt0(xc)))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk4_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_12]) ).
cnf(c_0_22,plain,
( aIdeal0(X1)
| aElementOf0(esk4_1(X1),X1)
| aElement0(esk5_1(X1))
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,hypothesis,
( ~ aElementOf0(sdtasdt0(esk5_1(slsdtgt0(xc)),esk3_1(slsdtgt0(xc))),slsdtgt0(xc))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]) ).
cnf(c_0_24,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_8])]) ).
cnf(c_0_25,hypothesis,
( aElement0(esk5_1(slsdtgt0(xc)))
| ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]) ).
cnf(c_0_26,hypothesis,
( ~ aElementOf0(esk3_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,hypothesis,
~ aSet0(slsdtgt0(xc)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_12]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : RNG106+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.09 % Command : run_ET %s %d
% 0.08/0.29 % Computer : n022.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Mon May 30 11:45:52 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.16/1.34 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.16/1.34 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.16/1.34 # Preprocessing time : 0.017 s
% 0.16/1.34
% 0.16/1.34 # Proof found!
% 0.16/1.34 # SZS status Theorem
% 0.16/1.34 # SZS output start CNFRefutation
% See solution above
% 0.16/1.34 # Proof object total steps : 29
% 0.16/1.34 # Proof object clause steps : 21
% 0.16/1.34 # Proof object formula steps : 8
% 0.16/1.34 # Proof object conjectures : 8
% 0.16/1.34 # Proof object clause conjectures : 5
% 0.16/1.34 # Proof object formula conjectures : 3
% 0.16/1.34 # Proof object initial clauses used : 10
% 0.16/1.34 # Proof object initial formulas used : 4
% 0.16/1.34 # Proof object generating inferences : 11
% 0.16/1.34 # Proof object simplifying inferences : 11
% 0.16/1.34 # Training examples: 0 positive, 0 negative
% 0.16/1.34 # Parsed axioms : 39
% 0.16/1.34 # Removed by relevancy pruning/SinE : 20
% 0.16/1.34 # Initial clauses : 46
% 0.16/1.34 # Removed in clause preprocessing : 2
% 0.16/1.34 # Initial clauses in saturation : 44
% 0.16/1.34 # Processed clauses : 85
% 0.16/1.34 # ...of these trivial : 0
% 0.16/1.34 # ...subsumed : 21
% 0.16/1.34 # ...remaining for further processing : 64
% 0.16/1.34 # Other redundant clauses eliminated : 3
% 0.16/1.34 # Clauses deleted for lack of memory : 0
% 0.16/1.34 # Backward-subsumed : 10
% 0.16/1.34 # Backward-rewritten : 0
% 0.16/1.34 # Generated clauses : 245
% 0.16/1.34 # ...of the previous two non-trivial : 227
% 0.16/1.34 # Contextual simplify-reflections : 10
% 0.16/1.34 # Paramodulations : 240
% 0.16/1.34 # Factorizations : 0
% 0.16/1.34 # Equation resolutions : 5
% 0.16/1.34 # Current number of processed clauses : 54
% 0.16/1.34 # Positive orientable unit clauses : 2
% 0.16/1.34 # Positive unorientable unit clauses: 0
% 0.16/1.34 # Negative unit clauses : 2
% 0.16/1.34 # Non-unit-clauses : 50
% 0.16/1.34 # Current number of unprocessed clauses: 160
% 0.16/1.34 # ...number of literals in the above : 837
% 0.16/1.34 # Current number of archived formulas : 0
% 0.16/1.34 # Current number of archived clauses : 10
% 0.16/1.34 # Clause-clause subsumption calls (NU) : 460
% 0.16/1.34 # Rec. Clause-clause subsumption calls : 310
% 0.16/1.34 # Non-unit clause-clause subsumptions : 41
% 0.16/1.34 # Unit Clause-clause subsumption calls : 2
% 0.16/1.34 # Rewrite failures with RHS unbound : 0
% 0.16/1.34 # BW rewrite match attempts : 0
% 0.16/1.34 # BW rewrite match successes : 0
% 0.16/1.34 # Condensation attempts : 0
% 0.16/1.34 # Condensation successes : 0
% 0.16/1.34 # Termbank termtop insertions : 7971
% 0.16/1.34
% 0.16/1.34 # -------------------------------------------------
% 0.16/1.34 # User time : 0.034 s
% 0.16/1.34 # System time : 0.001 s
% 0.16/1.34 # Total time : 0.035 s
% 0.16/1.34 # Maximum resident set size: 3324 pages
% 0.16/23.35 eprover: CPU time limit exceeded, terminating
% 0.16/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.37 eprover: No such file or directory
% 0.16/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38 eprover: No such file or directory
% 0.16/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.41 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.41 eprover: No such file or directory
% 0.16/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.42 eprover: No such file or directory
% 0.16/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.42 eprover: No such file or directory
% 0.16/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.43 eprover: No such file or directory
%------------------------------------------------------------------------------