TSTP Solution File: LAT381+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:11:05 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 112 ( 6 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 113 ( 26 ~; 30 |; 41 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 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 : 30 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__744,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xu,X1) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xv,X1) )
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox2/tmp/tmp.vlbNm8wX2i/E---3.1_17736.p',m__744) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vlbNm8wX2i/E---3.1_17736.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.vlbNm8wX2i/E---3.1_17736.p',mASymm) ).
fof(m__725,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/tmp/tmp.vlbNm8wX2i/E---3.1_17736.p',m__725) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox2/tmp/tmp.vlbNm8wX2i/E---3.1_17736.p',m__) ).
fof(c_0_5,hypothesis,
( aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xu,X1) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(xv,X1) )
& aSupremumOfIn0(xv,xS,xT) ),
inference(fof_simplification,[status(thm)],[m__744]) ).
fof(c_0_6,hypothesis,
! [X6,X7,X9,X10] :
( aElementOf0(xu,xT)
& ( ~ aElementOf0(X6,xS)
| sdtlseqdt0(X6,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ( aElementOf0(esk1_1(X7),xS)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(xu,X7) )
& ( ~ sdtlseqdt0(esk1_1(X7),X7)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(xu,X7) )
& ( ~ aUpperBoundOfIn0(X7,xS,xT)
| sdtlseqdt0(xu,X7) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ( ~ aElementOf0(X9,xS)
| sdtlseqdt0(X9,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ( aElementOf0(esk2_1(X10),xS)
| ~ aElementOf0(X10,xT)
| sdtlseqdt0(xv,X10) )
& ( ~ sdtlseqdt0(esk2_1(X10),X10)
| ~ aElementOf0(X10,xT)
| sdtlseqdt0(xv,X10) )
& ( ~ aUpperBoundOfIn0(X10,xS,xT)
| sdtlseqdt0(xv,X10) )
& aSupremumOfIn0(xv,xS,xT) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,plain,
! [X17,X18] :
( ~ aSet0(X17)
| ~ aElementOf0(X18,X17)
| aElement0(X18) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
fof(c_0_8,plain,
! [X26,X27] :
( ~ aElement0(X26)
| ~ aElement0(X27)
| ~ sdtlseqdt0(X26,X27)
| ~ sdtlseqdt0(X27,X26)
| X26 = X27 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])]) ).
cnf(c_0_9,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xv,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__725]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_17,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_18,plain,
( X1 = X2
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_20,hypothesis,
sdtlseqdt0(xu,xv),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_22,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_15])]) ).
cnf(c_0_23,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n022.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 09:50:24 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.vlbNm8wX2i/E---3.1_17736.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 17814 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUSF-FFMM32-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.42 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17817 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUSF-FFMM32-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 17
% 0.15/0.42 # Removed by relevancy pruning/SinE : 3
% 0.15/0.42 # Initial clauses : 40
% 0.15/0.42 # Removed in clause preprocessing : 3
% 0.15/0.42 # Initial clauses in saturation : 37
% 0.15/0.42 # Processed clauses : 74
% 0.15/0.42 # ...of these trivial : 4
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 70
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 29
% 0.15/0.42 # ...of the previous two non-redundant : 11
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 2
% 0.15/0.42 # Paramodulations : 29
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 40
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 34
% 0.15/0.42 # Positive orientable unit clauses : 15
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 1
% 0.15/0.42 # Non-unit-clauses : 18
% 0.15/0.42 # Current number of unprocessed clauses: 10
% 0.15/0.42 # ...number of literals in the above : 46
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 36
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 132
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 40
% 0.15/0.42 # Non-unit clause-clause subsumptions : 2
% 0.15/0.42 # Unit Clause-clause subsumption calls : 4
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 0
% 0.15/0.42 # BW rewrite match successes : 0
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 2972
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.007 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.008 s
% 0.15/0.42 # Maximum resident set size: 1868 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.009 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.011 s
% 0.15/0.42 # Maximum resident set size: 1696 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------