TSTP Solution File: RNG103+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG103+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:55 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 34 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 10 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% 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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAMDistr) ).
fof(m__,conjecture,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1979,hypothesis,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1979) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1905) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1956) ).
fof(c_0_5,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_6,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,hypothesis,
sdtasdt0(xc,xv) = xy,
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_9,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_10,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
fof(c_0_11,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_12,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_7,c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,hypothesis,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_14,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_15,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG103+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.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.34 % DateTime : Mon May 30 18:37:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.42 # Preprocessing time : 0.017 s
% 0.22/1.42
% 0.22/1.42 # Proof found!
% 0.22/1.42 # SZS status Theorem
% 0.22/1.42 # SZS output start CNFRefutation
% See solution above
% 0.22/1.42 # Proof object total steps : 17
% 0.22/1.42 # Proof object clause steps : 9
% 0.22/1.42 # Proof object formula steps : 8
% 0.22/1.42 # Proof object conjectures : 4
% 0.22/1.42 # Proof object clause conjectures : 1
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 7
% 0.22/1.42 # Proof object initial formulas used : 5
% 0.22/1.42 # Proof object generating inferences : 2
% 0.22/1.42 # Proof object simplifying inferences : 6
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 42
% 0.22/1.42 # Removed by relevancy pruning/SinE : 20
% 0.22/1.42 # Initial clauses : 45
% 0.22/1.42 # Removed in clause preprocessing : 2
% 0.22/1.42 # Initial clauses in saturation : 43
% 0.22/1.42 # Processed clauses : 225
% 0.22/1.42 # ...of these trivial : 31
% 0.22/1.42 # ...subsumed : 49
% 0.22/1.42 # ...remaining for further processing : 145
% 0.22/1.42 # Other redundant clauses eliminated : 1
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 0
% 0.22/1.42 # Backward-rewritten : 6
% 0.22/1.42 # Generated clauses : 1931
% 0.22/1.42 # ...of the previous two non-trivial : 1742
% 0.22/1.42 # Contextual simplify-reflections : 17
% 0.22/1.42 # Paramodulations : 1928
% 0.22/1.42 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 3
% 0.22/1.42 # Current number of processed clauses : 139
% 0.22/1.42 # Positive orientable unit clauses : 57
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 1
% 0.22/1.42 # Non-unit-clauses : 81
% 0.22/1.42 # Current number of unprocessed clauses: 1489
% 0.22/1.42 # ...number of literals in the above : 5612
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 6
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 1639
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 831
% 0.22/1.42 # Non-unit clause-clause subsumptions : 66
% 0.22/1.42 # Unit Clause-clause subsumption calls : 68
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 5
% 0.22/1.42 # BW rewrite match successes : 5
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 35101
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.054 s
% 0.22/1.42 # System time : 0.002 s
% 0.22/1.42 # Total time : 0.056 s
% 0.22/1.42 # Maximum resident set size: 4676 pages
%------------------------------------------------------------------------------