TSTP Solution File: LAT381+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT381+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:09:03 EDT 2023
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 18 unt; 0 def)
% Number of atoms : 93 ( 6 equ)
% Maximal formula atoms : 25 ( 2 avg)
% Number of connectives : 107 ( 46 ~; 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 ( 0 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/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',mDefSup) ).
fof(m__744,hypothesis,
( aSupremumOfIn0(xu,xS,xT)
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',m__744) ).
fof(m__725_01,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',m__725_01) ).
fof(m__725,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',m__725) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',mEOfElem) ).
fof(mASymm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',mASymm) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p',m__) ).
fof(c_0_7,plain,
! [X12,X13,X14,X15,X16] :
( ( aElementOf0(X14,X12)
| ~ aSupremumOfIn0(X14,X13,X12)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) )
& ( aUpperBoundOfIn0(X14,X13,X12)
| ~ aSupremumOfIn0(X14,X13,X12)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) )
& ( ~ aUpperBoundOfIn0(X15,X13,X12)
| sdtlseqdt0(X14,X15)
| ~ aSupremumOfIn0(X14,X13,X12)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) )
& ( aUpperBoundOfIn0(esk2_3(X12,X13,X16),X13,X12)
| ~ aElementOf0(X16,X12)
| ~ aUpperBoundOfIn0(X16,X13,X12)
| aSupremumOfIn0(X16,X13,X12)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) )
& ( ~ sdtlseqdt0(X16,esk2_3(X12,X13,X16))
| ~ aElementOf0(X16,X12)
| ~ aUpperBoundOfIn0(X16,X13,X12)
| aSupremumOfIn0(X16,X13,X12)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSup])])])])])]) ).
cnf(c_0_8,plain,
( sdtlseqdt0(X4,X1)
| ~ aUpperBoundOfIn0(X1,X2,X3)
| ~ aSupremumOfIn0(X4,X2,X3)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
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(X1,X2,X3)
| ~ aSupremumOfIn0(X1,X2,X3)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
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,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElementOf0(X6,X5)
| aElement0(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_15,plain,
( aElementOf0(X1,X2)
| ~ aSupremumOfIn0(X1,X3,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X19,X20] :
( ~ aElement0(X19)
| ~ aElement0(X20)
| ~ sdtlseqdt0(X19,X20)
| ~ sdtlseqdt0(X20,X19)
| X19 = X20 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])]) ).
cnf(c_0_17,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_18,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_19,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,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_21,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_22,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_11])]) ).
cnf(c_0_26,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_11])]) ).
cnf(c_0_27,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,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_29,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_30,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_23,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT381+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 10:35:28 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.BxduL6ETvV/E---3.1_26567.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 26690 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGUSF-FFMS32-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.21/0.50 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 26693 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGUSF-FFMS32-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 17
% 0.21/0.50 # Removed by relevancy pruning/SinE : 3
% 0.21/0.50 # Initial clauses : 25
% 0.21/0.50 # Removed in clause preprocessing : 3
% 0.21/0.50 # Initial clauses in saturation : 22
% 0.21/0.50 # Processed clauses : 62
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 62
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 40
% 0.21/0.50 # ...of the previous two non-redundant : 30
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 40
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 40
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 40
% 0.21/0.50 # Positive orientable unit clauses : 14
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 3
% 0.21/0.50 # Non-unit-clauses : 23
% 0.21/0.50 # Current number of unprocessed clauses: 12
% 0.21/0.50 # ...number of literals in the above : 54
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 22
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 175
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 32
% 0.21/0.50 # Non-unit clause-clause subsumptions : 2
% 0.21/0.50 # Unit Clause-clause subsumption calls : 29
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 2401
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1852 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.008 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1688 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------