TSTP Solution File: LAT381+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:12 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 19 unt; 0 def)
% Number of atoms : 94 ( 7 equ)
% Maximal formula atoms : 25 ( 2 avg)
% Number of connectives : 108 ( 47 ~; 44 |; 9 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 33 ( 1 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSup,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aSupremumOfIn0(X3,X2,X1)
<=> ( aElementOf0(X3,X1)
& aUpperBoundOfIn0(X3,X2,X1)
& ! [X4] :
( aUpperBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSup) ).
fof(m__744,hypothesis,
( aSupremumOfIn0(xu,xS,xT)
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__744) ).
fof(m__725_01,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__725_01) ).
fof(m__725,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__725) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mASymm) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8,X7] :
( ( aElementOf0(X7,X5)
| ~ aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| ~ aSet0(X5) )
& ( aUpperBoundOfIn0(X7,X6,X5)
| ~ aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| ~ aSet0(X5) )
& ( ~ aUpperBoundOfIn0(X8,X6,X5)
| sdtlseqdt0(X7,X8)
| ~ aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| ~ aSet0(X5) )
& ( aUpperBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)
| ~ aElementOf0(X7,X5)
| ~ aUpperBoundOfIn0(X7,X6,X5)
| aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| ~ aSet0(X5) )
& ( ~ sdtlseqdt0(X7,esk2_3(X5,X6,X7))
| ~ aElementOf0(X7,X5)
| ~ aUpperBoundOfIn0(X7,X6,X5)
| aSupremumOfIn0(X7,X6,X5)
| ~ aSubsetOf0(X6,X5)
| ~ aSet0(X5) ) ),
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)],[mDefSup])])])])])])]) ).
cnf(c_0_8,plain,
( sdtlseqdt0(X3,X4)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1)
| ~ aUpperBoundOfIn0(X4,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,hypothesis,
aSupremumOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[m__744]) ).
cnf(c_0_10,hypothesis,
aSubsetOf0(xS,xT),
inference(split_conjunct,[status(thm)],[m__725_01]) ).
cnf(c_0_11,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__725]) ).
cnf(c_0_12,plain,
( aUpperBoundOfIn0(X3,X2,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
aSupremumOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[m__744]) ).
fof(c_0_14,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])])])])]) ).
cnf(c_0_15,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aSupremumOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,negated_conjecture,
xu != xv,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_17,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_18,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_19,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]),c_0_11])]) ).
cnf(c_0_20,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xv,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xu,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_10]),c_0_11])]) ).
fof(c_0_23,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_11])]) ).
cnf(c_0_27,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_11])]) ).
cnf(c_0_28,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_10]),c_0_11])]) ).
cnf(c_0_30,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_31,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_24,c_0_25]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 29 20:04:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 33
% 0.22/1.41 # Proof object clause steps : 21
% 0.22/1.41 # Proof object formula steps : 12
% 0.22/1.41 # Proof object conjectures : 4
% 0.22/1.41 # Proof object clause conjectures : 1
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 10
% 0.22/1.41 # Proof object initial formulas used : 7
% 0.22/1.41 # Proof object generating inferences : 11
% 0.22/1.41 # Proof object simplifying inferences : 27
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 17
% 0.22/1.41 # Removed by relevancy pruning/SinE : 3
% 0.22/1.41 # Initial clauses : 25
% 0.22/1.41 # Removed in clause preprocessing : 3
% 0.22/1.41 # Initial clauses in saturation : 22
% 0.22/1.41 # Processed clauses : 42
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 41
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 44
% 0.22/1.41 # ...of the previous two non-trivial : 36
% 0.22/1.41 # Contextual simplify-reflections : 2
% 0.22/1.41 # Paramodulations : 44
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 41
% 0.22/1.41 # Positive orientable unit clauses : 14
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 25
% 0.22/1.41 # Current number of unprocessed clauses: 16
% 0.22/1.41 # ...number of literals in the above : 64
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 99
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 23
% 0.22/1.41 # Non-unit clause-clause subsumptions : 2
% 0.22/1.41 # Unit Clause-clause subsumption calls : 27
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 0
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 2346
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.015 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.018 s
% 0.22/1.41 # Maximum resident set size: 2980 pages
%------------------------------------------------------------------------------