TSTP Solution File: RNG088+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG088+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 56 ( 2 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 58 ( 18 ~; 14 |; 20 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__870) ).
fof(m__967,hypothesis,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__967) ).
fof(m__934,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__934) ).
fof(c_0_4,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(sdtpldt0(xl,xn),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])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X2,xJ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_11,negated_conjecture,
~ aElementOf0(sdtpldt0(xk,xm),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),xI)
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[m__967]) ).
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_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG088+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 08:27:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 16
% 0.24/1.42 # Proof object clause steps : 9
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 5
% 0.24/1.42 # Proof object clause conjectures : 2
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 4
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 6
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 29
% 0.24/1.42 # Removed by relevancy pruning/SinE : 11
% 0.24/1.42 # Initial clauses : 56
% 0.24/1.42 # Removed in clause preprocessing : 2
% 0.24/1.42 # Initial clauses in saturation : 54
% 0.24/1.42 # Processed clauses : 55
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 55
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 121
% 0.24/1.42 # ...of the previous two non-trivial : 114
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 119
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 2
% 0.24/1.42 # Current number of processed clauses : 55
% 0.24/1.42 # Positive orientable unit clauses : 19
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 35
% 0.24/1.42 # Current number of unprocessed clauses: 113
% 0.24/1.42 # ...number of literals in the above : 496
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 321
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 100
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 5558
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.020 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.022 s
% 0.24/1.42 # Maximum resident set size: 3100 pages
%------------------------------------------------------------------------------