TSTP Solution File: SEU140+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 19:30:31 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 45 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 10 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.EB42Xki2K4/E---3.1_18577.p',t63_xboole_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.EB42Xki2K4/E---3.1_18577.p',d7_xboole_0) ).
fof(t26_xboole_1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.EB42Xki2K4/E---3.1_18577.p',t26_xboole_1) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.EB42Xki2K4/E---3.1_18577.p',t3_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.EB42Xki2K4/E---3.1_18577.p',commutativity_k3_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
inference(assume_negation,[status(cth)],[t63_xboole_1]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ( ~ disjoint(X7,X8)
| set_intersection2(X7,X8) = empty_set )
& ( set_intersection2(X7,X8) != empty_set
| disjoint(X7,X8) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
fof(c_0_7,negated_conjecture,
( subset(esk1_0,esk2_0)
& disjoint(esk2_0,esk3_0)
& ~ disjoint(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X12,X13,X14] :
( ~ subset(X12,X13)
| subset(set_intersection2(X12,X14),set_intersection2(X13,X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_xboole_1])]) ).
cnf(c_0_9,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
disjoint(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X15] :
( ~ subset(X15,empty_set)
| X15 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
cnf(c_0_12,plain,
( subset(set_intersection2(X1,X3),set_intersection2(X2,X3))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
set_intersection2(esk2_0,esk3_0) = empty_set,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ disjoint(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,plain,
! [X18,X19] : set_intersection2(X18,X19) = set_intersection2(X19,X18),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_17,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( subset(set_intersection2(X1,esk3_0),empty_set)
| ~ subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
set_intersection2(esk1_0,esk3_0) != empty_set,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( set_intersection2(X1,esk3_0) = empty_set
| ~ subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
set_intersection2(esk3_0,esk1_0) != empty_set,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.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 08:12:50 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.EB42Xki2K4/E---3.1_18577.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 18655 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: FHUSM-FFSS22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.42 # G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 18658 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C18AMC_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: FHUSM-FFSS22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18AMC_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 : 18
% 0.15/0.42 # Removed by relevancy pruning/SinE : 4
% 0.15/0.42 # Initial clauses : 17
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 17
% 0.15/0.42 # Processed clauses : 51
% 0.15/0.42 # ...of these trivial : 2
% 0.15/0.42 # ...subsumed : 3
% 0.15/0.42 # ...remaining for further processing : 46
% 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 : 2
% 0.15/0.42 # Generated clauses : 46
% 0.15/0.42 # ...of the previous two non-redundant : 31
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 46
% 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 : 23
% 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 : 27
% 0.15/0.42 # Positive orientable unit clauses : 10
% 0.15/0.42 # Positive unorientable unit clauses: 1
% 0.15/0.42 # Negative unit clauses : 3
% 0.15/0.42 # Non-unit-clauses : 13
% 0.15/0.42 # Current number of unprocessed clauses: 14
% 0.15/0.42 # ...number of literals in the above : 28
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 19
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 11
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 11
% 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 : 17
% 0.15/0.42 # BW rewrite match successes : 15
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 1017
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.006 s
% 0.15/0.42 # System time : 0.000 s
% 0.15/0.42 # Total time : 0.006 s
% 0.15/0.42 # Maximum resident set size: 1752 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.008 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: 1684 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------