TSTP Solution File: SET629+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:20:01 EDT 2023
% Result : Timeout 0.38s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 73 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 74 ( 33 ~; 23 |; 11 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 6 sgn; 40 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',difference_defn) ).
fof(prove_intersection_and_difference_disjoint,conjecture,
! [X1,X2] : disjoint(intersection(X1,X2),difference(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',prove_intersection_and_difference_disjoint) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',disjoint_defn) ).
fof(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',intersect_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',intersection_defn) ).
fof(symmetry_of_intersect,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',symmetry_of_intersect) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p',commutativity_of_intersection) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[difference_defn]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] : disjoint(intersection(X1,X2),difference(X1,X2)),
inference(assume_negation,[status(cth)],[prove_intersection_and_difference_disjoint]) ).
fof(c_0_9,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[disjoint_defn]) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( ( member(X10,X8)
| ~ member(X10,difference(X8,X9)) )
& ( ~ member(X10,X9)
| ~ member(X10,difference(X8,X9)) )
& ( ~ member(X10,X8)
| member(X10,X9)
| member(X10,difference(X8,X9)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X16,X17,X19,X20,X21] :
( ( member(esk3_2(X16,X17),X16)
| ~ intersect(X16,X17) )
& ( member(esk3_2(X16,X17),X17)
| ~ intersect(X16,X17) )
& ( ~ member(X21,X19)
| ~ member(X21,X20)
| intersect(X19,X20) ) ),
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)],[intersect_defn])])])])])]) ).
fof(c_0_12,plain,
! [X11,X12,X13] :
( ( member(X13,X11)
| ~ member(X13,intersection(X11,X12)) )
& ( member(X13,X12)
| ~ member(X13,intersection(X11,X12)) )
& ( ~ member(X13,X11)
| ~ member(X13,X12)
| member(X13,intersection(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])]) ).
fof(c_0_13,negated_conjecture,
~ disjoint(intersection(esk1_0,esk2_0),difference(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,plain,
! [X6,X7] :
( ( ~ disjoint(X6,X7)
| ~ intersect(X6,X7) )
& ( intersect(X6,X7)
| disjoint(X6,X7) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( member(esk3_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( member(esk3_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X22,X23] :
( ~ intersect(X22,X23)
| intersect(X23,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_of_intersect])]) ).
cnf(c_0_20,negated_conjecture,
~ disjoint(intersection(esk1_0,esk2_0),difference(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ intersect(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( member(esk3_2(X1,intersection(X2,X3)),X2)
| ~ intersect(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X14,X15] : intersection(X14,X15) = intersection(X15,X14),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_25,plain,
( intersect(X2,X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
intersect(intersection(esk1_0,esk2_0),difference(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
~ intersect(difference(X1,X2),intersection(X2,X3)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
intersect(difference(esk1_0,esk2_0),intersection(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
~ intersect(difference(X1,X2),intersection(X3,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 16:59:46 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Q7pVeiiy3J/E---3.1_17564.p
% 0.38/300.09 # Version: 3.1pre001
% 0.38/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.38/300.09 # Starting new_bool_1 with 300s (1) cores
% 0.38/300.09 # Starting sh5l with 300s (1) cores
% 0.38/300.09 # new_bool_3 with pid 17715 completed with status 0
% 0.38/300.09 # Result found by new_bool_3
% 0.38/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.38/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/300.09 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.38/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.38/300.09 # SAT001_MinMin_p005000_rr_RG with pid 17726 completed with status 0
% 0.38/300.09 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.38/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.38/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/300.09 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.38/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.38/300.09 # Preprocessing time : 0.001 s
% 0.38/300.09 # Presaturation interreduction done
% 0.38/300.09
% 0.38/300.09 # Proof found!
% 0.38/300.09 # SZS status Theorem
% 0.38/300.09 # SZS output start CNFRefutation
% See solution above
% 0.38/300.09 # Parsed axioms : 8
% 0.38/300.09 # Removed by relevancy pruning/SinE : 0
% 0.38/300.09 # Initial clauses : 18
% 0.38/300.09 # Removed in clause preprocessing : 2
% 0.38/300.09 # Initial clauses in saturation : 16
% 0.38/300.09 # Processed clauses : 79
% 0.38/300.09 # ...of these trivial : 1
% 0.38/300.09 # ...subsumed : 16
% 0.38/300.09 # ...remaining for further processing : 62
% 0.38/300.09 # Other redundant clauses eliminated : 0
% 0.38/300.09 # Clauses deleted for lack of memory : 0
% 0.38/300.09 # Backward-subsumed : 0
% 0.38/300.09 # Backward-rewritten : 0
% 0.38/300.09 # Generated clauses : 131
% 0.38/300.09 # ...of the previous two non-redundant : 98
% 0.38/300.09 # ...aggressively subsumed : 0
% 0.38/300.09 # Contextual simplify-reflections : 0
% 0.38/300.09 # Paramodulations : 128
% 0.38/300.09 # Factorizations : 2
% 0.38/300.09 # NegExts : 0
% 0.38/300.09 # Equation resolutions : 0
% 0.38/300.09 # Total rewrite steps : 22
% 0.38/300.09 # Propositional unsat checks : 0
% 0.38/300.09 # Propositional check models : 0
% 0.38/300.09 # Propositional check unsatisfiable : 0
% 0.38/300.09 # Propositional clauses : 0
% 0.38/300.09 # Propositional clauses after purity: 0
% 0.38/300.09 # Propositional unsat core size : 0
% 0.38/300.09 # Propositional preprocessing time : 0.000
% 0.38/300.09 # Propositional encoding time : 0.000
% 0.38/300.09 # Propositional solver time : 0.000
% 0.38/300.09 # Success case prop preproc time : 0.000
% 0.38/300.09 # Success case prop encoding time : 0.000
% 0.38/300.09 # Success case prop solver time : 0.000
% 0.38/300.09 # Current number of processed clauses : 45
% 0.38/300.09 # Positive orientable unit clauses : 8
% 0.38/300.09 # Positive unorientable unit clauses: 1
% 0.38/300.09 # Negative unit clauses : 10
% 0.38/300.09 # Non-unit-clauses : 26
% 0.38/300.09 # Current number of unprocessed clauses: 51
% 0.38/300.09 # ...number of literals in the above : 144
% 0.38/300.09 # Current number of archived formulas : 0
% 0.38/300.09 # Current number of archived clauses : 17
% 0.38/300.09 # Clause-clause subsumption calls (NU) : 116
% 0.38/300.09 # Rec. Clause-clause subsumption calls : 111
% 0.38/300.09 # Non-unit clause-clause subsumptions : 9
% 0.38/300.09 # Unit Clause-clause subsumption calls : 72
% 0.38/300.09 # Rewrite failures with RHS unbound : 0
% 0.38/300.09 # BW rewrite match attempts : 2
% 0.38/300.09 # BW rewrite match successes : 2
% 0.38/300.09 # Condensation attempts : 0
% 0.38/300.09 # Condensation successes : 0
% 0.38/300.09 # Termbank termtop insertions : 2444
% 0.38/300.09
% 0.38/300.09 # -------------------------------------------------
% 0.38/300.09 # User time : 0.008 s
% 0.38/300.09 # System time : 0.002 s
% 0.38/300.09 # Total time : 0.010 s
% 0.38/300.09 # Maximum resident set size: 1760 pages
% 0.38/300.09
% 0.38/300.09 # -------------------------------------------------
% 0.38/300.09 # User time : 0.010 s
% 0.38/300.09 # System time : 0.004 s
% 0.38/300.09 # Total time : 0.014 s
% 0.38/300.09 # Maximum resident set size: 1676 pages
% 0.38/300.09 % E---3.1 exiting
% 0.38/300.09 % E---3.1 exiting
%------------------------------------------------------------------------------