TSTP Solution File: RNG103+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG103+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:55 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 19 unt; 0 def)
% Number of atoms : 58 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 46 ( 16 ~; 11 |; 18 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAMDistr) ).
fof(m__1933,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xx )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1933) ).
fof(m__,conjecture,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1905) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1956) ).
fof(m__1979,hypothesis,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1979) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6) )
& ( sdtasdt0(sdtpldt0(X5,X6),X4) = sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
| ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).
fof(c_0_7,hypothesis,
( aElement0(esk1_0)
& sdtasdt0(xc,esk1_0) = xx
& aElementOf0(xx,slsdtgt0(xc))
& aElement0(esk2_0)
& sdtasdt0(xc,esk2_0) = xy
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1933])])])]) ).
fof(c_0_8,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
sdtasdt0(xc,esk2_0) = xy,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_12,hypothesis,
aElement0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
( sdtpldt0(sdtasdt0(xc,X1),xy) = sdtasdt0(xc,sdtpldt0(X1,esk2_0))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_15,hypothesis,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_16,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_17,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xc,esk1_0) = xx,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,hypothesis,
aElement0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xc,xv) = xy,
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_22,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_23,negated_conjecture,
sdtasdt0(xc,sdtpldt0(xu,xv)) != sdtasdt0(xc,sdtpldt0(xu,esk2_0)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,hypothesis,
sdtasdt0(xc,sdtpldt0(xu,esk2_0)) = sdtasdt0(xc,sdtpldt0(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_20])]),c_0_18]) ).
cnf(c_0_25,hypothesis,
( sdtpldt0(sdtasdt0(xc,X1),xy) = sdtasdt0(xc,sdtpldt0(X1,xv))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21]),c_0_11]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
sdtasdt0(xc,sdtpldt0(xu,xv)) != sdtasdt0(xc,sdtpldt0(esk1_0,esk2_0)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_18]),c_0_24]),c_0_16])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG103+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon May 30 12:14:51 EDT 2022
% 0.14/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 : 28
% 0.24/1.42 # Proof object clause steps : 18
% 0.24/1.42 # Proof object formula steps : 10
% 0.24/1.42 # Proof object conjectures : 6
% 0.24/1.42 # Proof object clause conjectures : 3
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 11
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 5
% 0.24/1.42 # Proof object simplifying inferences : 18
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 42
% 0.24/1.42 # Removed by relevancy pruning/SinE : 20
% 0.24/1.42 # Initial clauses : 49
% 0.24/1.42 # Removed in clause preprocessing : 2
% 0.24/1.42 # Initial clauses in saturation : 47
% 0.24/1.42 # Processed clauses : 315
% 0.24/1.42 # ...of these trivial : 48
% 0.24/1.42 # ...subsumed : 66
% 0.24/1.42 # ...remaining for further processing : 201
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 21
% 0.24/1.42 # Generated clauses : 2781
% 0.24/1.42 # ...of the previous two non-trivial : 2564
% 0.24/1.42 # Contextual simplify-reflections : 20
% 0.24/1.42 # Paramodulations : 2770
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 11
% 0.24/1.42 # Current number of processed clauses : 180
% 0.24/1.42 # Positive orientable unit clauses : 82
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 97
% 0.24/1.42 # Current number of unprocessed clauses: 2121
% 0.24/1.42 # ...number of literals in the above : 7544
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 21
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1763
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 950
% 0.24/1.42 # Non-unit clause-clause subsumptions : 86
% 0.24/1.42 # Unit Clause-clause subsumption calls : 172
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 11
% 0.24/1.42 # BW rewrite match successes : 10
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 48842
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.064 s
% 0.24/1.42 # System time : 0.006 s
% 0.24/1.42 # Total time : 0.070 s
% 0.24/1.42 # Maximum resident set size: 5212 pages
%------------------------------------------------------------------------------