TSTP Solution File: RNG089+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG089+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:52 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 70 ( 5 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 72 ( 18 ~; 14 |; 34 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__870,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( aElementOf0(X1,xJ)
=> ( ! [X2] :
( aElementOf0(X2,xJ)
=> aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__870) ).
fof(m__901,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = xx )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = xy )
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__901) ).
fof(m__934,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__934) ).
fof(c_0_4,negated_conjecture,
~ ( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_6,hypothesis,
! [X3,X4,X5,X6,X7,X8] :
( aSet0(xI)
& ( ~ aElementOf0(X4,xI)
| aElementOf0(sdtpldt0(X3,X4),xI)
| ~ aElementOf0(X3,xI) )
& ( ~ aElement0(X5)
| aElementOf0(sdtasdt0(X5,X3),xI)
| ~ aElementOf0(X3,xI) )
& aIdeal0(xI)
& aSet0(xJ)
& ( ~ aElementOf0(X7,xJ)
| aElementOf0(sdtpldt0(X6,X7),xJ)
| ~ aElementOf0(X6,xJ) )
& ( ~ aElement0(X8)
| aElementOf0(sdtasdt0(X8,X6),xJ)
| ~ aElementOf0(X6,xJ) )
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__870])])])])])]) ).
fof(c_0_7,hypothesis,
( aElementOf0(esk1_0,xI)
& aElementOf0(esk2_0,xJ)
& sdtpldt0(esk1_0,esk2_0) = xx
& aElementOf0(xx,sdtpldt1(xI,xJ))
& aElementOf0(esk3_0,xI)
& aElementOf0(esk4_0,xJ)
& sdtpldt0(esk3_0,esk4_0) = xy
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__901])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(sdtasdt0(X2,X1),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_11,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(sdtasdt0(xz,xk),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(sdtasdt0(X2,X1),xI)
| ~ aElementOf0(X1,xI)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_15,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG089+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 10:08:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.018 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 16
% 0.24/1.41 # Proof object clause steps : 8
% 0.24/1.41 # Proof object formula steps : 8
% 0.24/1.41 # Proof object conjectures : 5
% 0.24/1.41 # Proof object clause conjectures : 2
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 6
% 0.24/1.41 # Proof object initial formulas used : 4
% 0.24/1.41 # Proof object generating inferences : 2
% 0.24/1.41 # Proof object simplifying inferences : 6
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 30
% 0.24/1.41 # Removed by relevancy pruning/SinE : 11
% 0.24/1.41 # Initial clauses : 58
% 0.24/1.41 # Removed in clause preprocessing : 2
% 0.24/1.41 # Initial clauses in saturation : 56
% 0.24/1.41 # Processed clauses : 61
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 61
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 129
% 0.24/1.41 # ...of the previous two non-trivial : 122
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 127
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 2
% 0.24/1.41 # Current number of processed clauses : 61
% 0.24/1.41 # Positive orientable unit clauses : 21
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 1
% 0.24/1.41 # Non-unit-clauses : 39
% 0.24/1.41 # Current number of unprocessed clauses: 117
% 0.24/1.41 # ...number of literals in the above : 506
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 340
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 113
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 5679
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.020 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.022 s
% 0.24/1.41 # Maximum resident set size: 3092 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------