TSTP Solution File: RNG105+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG105+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 82 ( 24 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 91 ( 35 ~; 29 |; 25 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 26 ( 0 sgn 10 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2010,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2010) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).
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__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1956) ).
fof(m__2043,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2043) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1933) ).
fof(c_0_8,negated_conjecture,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,negated_conjecture,
! [X2,X3] :
( ( ~ aElement0(X3)
| sdtasdt0(xc,X3) != sdtasdt0(xz,xx)
| ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy) )
& ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy) )
& ( ~ aElement0(X3)
| sdtasdt0(xc,X3) != sdtasdt0(xz,xx)
| ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) ) ),
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)],[c_0_8])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( sdtasdt0(xc,X1) != sdtpldt0(xx,xy)
| ~ aElement0(X1)
| sdtasdt0(xc,X2) != sdtasdt0(xz,xx)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_12,negated_conjecture,
( sdtasdt0(xc,X1) != sdtasdt0(xc,sdtpldt0(xu,xv))
| sdtasdt0(xc,X2) != sdtasdt0(xz,xx)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_14,negated_conjecture,
( sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(sdtpldt0(xu,xv))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_17,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_18,negated_conjecture,
( sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[m__2043]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_21,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])])])]) ).
cnf(c_0_22,hypothesis,
~ aElement0(sdtasdt0(xu,xz)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG105+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 18:14:42 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 : 26
% 0.24/1.42 # Proof object clause steps : 13
% 0.24/1.42 # Proof object formula steps : 13
% 0.24/1.42 # Proof object conjectures : 7
% 0.24/1.42 # Proof object clause conjectures : 4
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 8
% 0.24/1.42 # Proof object generating inferences : 4
% 0.24/1.42 # Proof object simplifying inferences : 7
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 44
% 0.24/1.42 # Removed by relevancy pruning/SinE : 24
% 0.24/1.42 # Initial clauses : 48
% 0.24/1.42 # Removed in clause preprocessing : 2
% 0.24/1.42 # Initial clauses in saturation : 46
% 0.24/1.42 # Processed clauses : 81
% 0.24/1.42 # ...of these trivial : 11
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 69
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 3
% 0.24/1.42 # Backward-rewritten : 4
% 0.24/1.42 # Generated clauses : 186
% 0.24/1.42 # ...of the previous two non-trivial : 184
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 182
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 4
% 0.24/1.42 # Current number of processed clauses : 62
% 0.24/1.42 # Positive orientable unit clauses : 23
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 36
% 0.24/1.42 # Current number of unprocessed clauses: 135
% 0.24/1.42 # ...number of literals in the above : 497
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 7
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 131
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 71
% 0.24/1.42 # Non-unit clause-clause subsumptions : 4
% 0.24/1.42 # Unit Clause-clause subsumption calls : 23
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 2
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 6322
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.023 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.026 s
% 0.24/1.42 # Maximum resident set size: 3088 pages
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------