TSTP Solution File: LAT382+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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 : Sun Jul 17 04:48:13 EDT 2022
% Result : Theorem 0.18s 1.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 92 ( 7 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 95 ( 28 ~; 28 |; 29 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__792,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(xu,X1) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(X1,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(xv,X1) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(X1,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__792) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mASymm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mASymm) ).
fof(m__773,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__773) ).
fof(c_0_5,hypothesis,
! [X3,X4,X6,X7] :
( aElementOf0(xu,xT)
& ( ~ aElementOf0(X3,xS)
| sdtlseqdt0(xu,X3) )
& aLowerBoundOfIn0(xu,xS,xT)
& ( aElementOf0(esk7_1(X4),xS)
| ~ aElementOf0(X4,xT)
| sdtlseqdt0(X4,xu) )
& ( ~ sdtlseqdt0(X4,esk7_1(X4))
| ~ aElementOf0(X4,xT)
| sdtlseqdt0(X4,xu) )
& ( ~ aLowerBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(X4,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ( ~ aElementOf0(X6,xS)
| sdtlseqdt0(xv,X6) )
& aLowerBoundOfIn0(xv,xS,xT)
& ( aElementOf0(esk8_1(X7),xS)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,xv) )
& ( ~ sdtlseqdt0(X7,esk8_1(X7))
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,xv) )
& ( ~ aLowerBoundOfIn0(X7,xS,xT)
| sdtlseqdt0(X7,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__792])])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aElementOf0(X4,X3)
| aElement0(X4) ),
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)],[mEOfElem])])])])]) ).
fof(c_0_7,negated_conjecture,
xu != xv,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| ~ sdtlseqdt0(X3,X4)
| ~ sdtlseqdt0(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])]) ).
cnf(c_0_9,hypothesis,
( sdtlseqdt0(X1,xu)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
aLowerBoundOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xv,xT),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_15,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_19,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
( sdtlseqdt0(X1,xv)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,hypothesis,
aLowerBoundOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,hypothesis,
~ sdtlseqdt0(xu,xv),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.11 % Command : run_ET %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Wed Jun 29 12:09:28 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.18/1.37 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.37 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.37 # Preprocessing time : 0.012 s
% 0.18/1.37
% 0.18/1.37 # Failure: Out of unprocessed clauses!
% 0.18/1.37 # OLD status GaveUp
% 0.18/1.37 # Parsed axioms : 18
% 0.18/1.37 # Removed by relevancy pruning/SinE : 10
% 0.18/1.37 # Initial clauses : 34
% 0.18/1.37 # Removed in clause preprocessing : 1
% 0.18/1.37 # Initial clauses in saturation : 33
% 0.18/1.37 # Processed clauses : 135
% 0.18/1.37 # ...of these trivial : 5
% 0.18/1.37 # ...subsumed : 32
% 0.18/1.37 # ...remaining for further processing : 98
% 0.18/1.37 # Other redundant clauses eliminated : 0
% 0.18/1.37 # Clauses deleted for lack of memory : 0
% 0.18/1.37 # Backward-subsumed : 2
% 0.18/1.37 # Backward-rewritten : 0
% 0.18/1.37 # Generated clauses : 142
% 0.18/1.37 # ...of the previous two non-trivial : 102
% 0.18/1.37 # Contextual simplify-reflections : 48
% 0.18/1.37 # Paramodulations : 142
% 0.18/1.37 # Factorizations : 0
% 0.18/1.37 # Equation resolutions : 0
% 0.18/1.37 # Current number of processed clauses : 96
% 0.18/1.37 # Positive orientable unit clauses : 13
% 0.18/1.37 # Positive unorientable unit clauses: 0
% 0.18/1.37 # Negative unit clauses : 1
% 0.18/1.37 # Non-unit-clauses : 82
% 0.18/1.37 # Current number of unprocessed clauses: 0
% 0.18/1.37 # ...number of literals in the above : 0
% 0.18/1.37 # Current number of archived formulas : 0
% 0.18/1.37 # Current number of archived clauses : 2
% 0.18/1.37 # Clause-clause subsumption calls (NU) : 3396
% 0.18/1.37 # Rec. Clause-clause subsumption calls : 803
% 0.18/1.37 # Non-unit clause-clause subsumptions : 82
% 0.18/1.37 # Unit Clause-clause subsumption calls : 0
% 0.18/1.37 # Rewrite failures with RHS unbound : 0
% 0.18/1.37 # BW rewrite match attempts : 0
% 0.18/1.37 # BW rewrite match successes : 0
% 0.18/1.37 # Condensation attempts : 0
% 0.18/1.37 # Condensation successes : 0
% 0.18/1.37 # Termbank termtop insertions : 6042
% 0.18/1.37
% 0.18/1.37 # -------------------------------------------------
% 0.18/1.37 # User time : 0.020 s
% 0.18/1.37 # System time : 0.001 s
% 0.18/1.37 # Total time : 0.021 s
% 0.18/1.37 # Maximum resident set size: 3252 pages
% 0.18/1.37 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.18/1.37 # Preprocessing time : 0.015 s
% 0.18/1.37
% 0.18/1.37 # Proof found!
% 0.18/1.37 # SZS status Theorem
% 0.18/1.37 # SZS output start CNFRefutation
% See solution above
% 0.18/1.37 # Proof object total steps : 25
% 0.18/1.37 # Proof object clause steps : 15
% 0.18/1.37 # Proof object formula steps : 10
% 0.18/1.37 # Proof object conjectures : 4
% 0.18/1.37 # Proof object clause conjectures : 1
% 0.18/1.37 # Proof object formula conjectures : 3
% 0.18/1.37 # Proof object initial clauses used : 10
% 0.18/1.37 # Proof object initial formulas used : 5
% 0.18/1.37 # Proof object generating inferences : 5
% 0.18/1.37 # Proof object simplifying inferences : 9
% 0.18/1.37 # Training examples: 0 positive, 0 negative
% 0.18/1.37 # Parsed axioms : 18
% 0.18/1.37 # Removed by relevancy pruning/SinE : 0
% 0.18/1.37 # Initial clauses : 52
% 0.18/1.37 # Removed in clause preprocessing : 3
% 0.18/1.37 # Initial clauses in saturation : 49
% 0.18/1.37 # Processed clauses : 61
% 0.18/1.37 # ...of these trivial : 1
% 0.18/1.37 # ...subsumed : 1
% 0.18/1.37 # ...remaining for further processing : 58
% 0.18/1.37 # Other redundant clauses eliminated : 0
% 0.18/1.37 # Clauses deleted for lack of memory : 0
% 0.18/1.37 # Backward-subsumed : 0
% 0.18/1.37 # Backward-rewritten : 0
% 0.18/1.37 # Generated clauses : 67
% 0.18/1.37 # ...of the previous two non-trivial : 57
% 0.18/1.37 # Contextual simplify-reflections : 4
% 0.18/1.37 # Paramodulations : 67
% 0.18/1.37 # Factorizations : 0
% 0.18/1.37 # Equation resolutions : 0
% 0.18/1.37 # Current number of processed clauses : 58
% 0.18/1.37 # Positive orientable unit clauses : 14
% 0.18/1.37 # Positive unorientable unit clauses: 0
% 0.18/1.37 # Negative unit clauses : 4
% 0.18/1.37 # Non-unit-clauses : 40
% 0.18/1.37 # Current number of unprocessed clauses: 45
% 0.18/1.37 # ...number of literals in the above : 162
% 0.18/1.37 # Current number of archived formulas : 0
% 0.18/1.37 # Current number of archived clauses : 0
% 0.18/1.37 # Clause-clause subsumption calls (NU) : 308
% 0.18/1.37 # Rec. Clause-clause subsumption calls : 54
% 0.18/1.37 # Non-unit clause-clause subsumptions : 4
% 0.18/1.37 # Unit Clause-clause subsumption calls : 67
% 0.18/1.37 # Rewrite failures with RHS unbound : 0
% 0.18/1.37 # BW rewrite match attempts : 0
% 0.18/1.37 # BW rewrite match successes : 0
% 0.18/1.37 # Condensation attempts : 0
% 0.18/1.37 # Condensation successes : 0
% 0.18/1.37 # Termbank termtop insertions : 4484
% 0.18/1.37
% 0.18/1.37 # -------------------------------------------------
% 0.18/1.37 # User time : 0.016 s
% 0.18/1.37 # System time : 0.001 s
% 0.18/1.37 # Total time : 0.017 s
% 0.18/1.37 # Maximum resident set size: 2964 pages
%------------------------------------------------------------------------------