TSTP Solution File: SET630+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:23:11 EDT 2023
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 17 unt; 0 def)
% Number of atoms : 45 ( 6 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 35 ( 16 ~; 13 |; 3 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.WBGd5uER0M/E---3.1_16449.p',disjoint_defn) ).
fof(prove_intersection_and_symmetric_difference_disjoint,conjecture,
! [X1,X2] : disjoint(intersection(X1,X2),symmetric_difference(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.WBGd5uER0M/E---3.1_16449.p',prove_intersection_and_symmetric_difference_disjoint) ).
fof(intersection_and_union_disjoint,axiom,
! [X1,X2] : disjoint(intersection(X1,X2),difference(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.WBGd5uER0M/E---3.1_16449.p',intersection_and_union_disjoint) ).
fof(intersect_with_union,axiom,
! [X1,X2,X3] :
( intersect(X1,union(X2,X3))
<=> ( intersect(X1,X2)
| intersect(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WBGd5uER0M/E---3.1_16449.p',intersect_with_union) ).
fof(symmetric_difference_defn,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.WBGd5uER0M/E---3.1_16449.p',symmetric_difference_defn) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.WBGd5uER0M/E---3.1_16449.p',commutativity_of_intersection) ).
fof(c_0_6,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[disjoint_defn]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] : disjoint(intersection(X1,X2),symmetric_difference(X1,X2)),
inference(assume_negation,[status(cth)],[prove_intersection_and_symmetric_difference_disjoint]) ).
fof(c_0_8,plain,
! [X8,X9] :
( ( ~ disjoint(X8,X9)
| ~ intersect(X8,X9) )
& ( intersect(X8,X9)
| disjoint(X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_9,plain,
! [X6,X7] : disjoint(intersection(X6,X7),difference(X6,X7)),
inference(variable_rename,[status(thm)],[intersection_and_union_disjoint]) ).
fof(c_0_10,plain,
! [X19,X20,X21] :
( ( ~ intersect(X19,union(X20,X21))
| intersect(X19,X20)
| intersect(X19,X21) )
& ( ~ intersect(X19,X20)
| intersect(X19,union(X20,X21)) )
& ( ~ intersect(X19,X21)
| intersect(X19,union(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersect_with_union])])]) ).
fof(c_0_11,plain,
! [X10,X11] : symmetric_difference(X10,X11) = union(difference(X10,X11),difference(X11,X10)),
inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).
fof(c_0_12,negated_conjecture,
~ disjoint(intersection(esk1_0,esk2_0),symmetric_difference(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_13,plain,
( ~ disjoint(X1,X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
disjoint(intersection(X1,X2),difference(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X17,X18] : intersection(X17,X18) = intersection(X18,X17),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_16,plain,
( intersect(X1,X2)
| intersect(X1,X3)
| ~ intersect(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ disjoint(intersection(esk1_0,esk2_0),symmetric_difference(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
~ intersect(intersection(X1,X2),difference(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( intersect(X1,difference(X2,X3))
| intersect(X1,difference(X3,X2))
| ~ intersect(X1,symmetric_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
intersect(intersection(esk1_0,esk2_0),symmetric_difference(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
~ intersect(intersection(X1,X2),difference(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n001.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 17:56:06 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.13/0.41 Running first-order model finding
% 0.13/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.WBGd5uER0M/E---3.1_16449.p
% 0.13/0.42 # Version: 3.1pre001
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # Starting sh5l with 300s (1) cores
% 0.13/0.42 # new_bool_1 with pid 16528 completed with status 0
% 0.13/0.42 # Result found by new_bool_1
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 # Search class: FGHSM-FFSF22-SFFFFFNN
% 0.13/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.42 # SAT001_MinMin_p005000_rr_RG with pid 16532 completed with status 0
% 0.13/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 # Search class: FGHSM-FFSF22-SFFFFFNN
% 0.13/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.42 # Preprocessing time : 0.001 s
% 0.13/0.42 # Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 # Proof found!
% 0.13/0.42 # SZS status Theorem
% 0.13/0.42 # SZS output start CNFRefutation
% See solution above
% 0.13/0.42 # Parsed axioms : 12
% 0.13/0.42 # Removed by relevancy pruning/SinE : 0
% 0.13/0.42 # Initial clauses : 22
% 0.13/0.42 # Removed in clause preprocessing : 2
% 0.13/0.42 # Initial clauses in saturation : 20
% 0.13/0.42 # Processed clauses : 160
% 0.13/0.42 # ...of these trivial : 20
% 0.13/0.42 # ...subsumed : 37
% 0.13/0.42 # ...remaining for further processing : 103
% 0.13/0.42 # Other redundant clauses eliminated : 0
% 0.13/0.42 # Clauses deleted for lack of memory : 0
% 0.13/0.42 # Backward-subsumed : 0
% 0.13/0.42 # Backward-rewritten : 0
% 0.13/0.42 # Generated clauses : 361
% 0.13/0.42 # ...of the previous two non-redundant : 216
% 0.13/0.42 # ...aggressively subsumed : 0
% 0.13/0.42 # Contextual simplify-reflections : 0
% 0.13/0.42 # Paramodulations : 359
% 0.13/0.42 # Factorizations : 2
% 0.13/0.42 # NegExts : 0
% 0.13/0.42 # Equation resolutions : 0
% 0.13/0.42 # Total rewrite steps : 154
% 0.13/0.42 # Propositional unsat checks : 0
% 0.13/0.42 # Propositional check models : 0
% 0.13/0.42 # Propositional check unsatisfiable : 0
% 0.13/0.42 # Propositional clauses : 0
% 0.13/0.42 # Propositional clauses after purity: 0
% 0.13/0.42 # Propositional unsat core size : 0
% 0.13/0.42 # Propositional preprocessing time : 0.000
% 0.13/0.42 # Propositional encoding time : 0.000
% 0.13/0.42 # Propositional solver time : 0.000
% 0.13/0.42 # Success case prop preproc time : 0.000
% 0.13/0.42 # Success case prop encoding time : 0.000
% 0.13/0.42 # Success case prop solver time : 0.000
% 0.13/0.42 # Current number of processed clauses : 83
% 0.13/0.42 # Positive orientable unit clauses : 39
% 0.13/0.42 # Positive unorientable unit clauses: 3
% 0.13/0.42 # Negative unit clauses : 3
% 0.13/0.42 # Non-unit-clauses : 38
% 0.13/0.42 # Current number of unprocessed clauses: 92
% 0.13/0.42 # ...number of literals in the above : 213
% 0.13/0.42 # Current number of archived formulas : 0
% 0.13/0.42 # Current number of archived clauses : 20
% 0.13/0.42 # Clause-clause subsumption calls (NU) : 401
% 0.13/0.42 # Rec. Clause-clause subsumption calls : 393
% 0.13/0.42 # Non-unit clause-clause subsumptions : 31
% 0.13/0.43 # Unit Clause-clause subsumption calls : 128
% 0.13/0.43 # Rewrite failures with RHS unbound : 0
% 0.13/0.43 # BW rewrite match attempts : 9
% 0.13/0.43 # BW rewrite match successes : 8
% 0.13/0.43 # Condensation attempts : 0
% 0.13/0.43 # Condensation successes : 0
% 0.13/0.43 # Termbank termtop insertions : 4392
% 0.13/0.43
% 0.13/0.43 # -------------------------------------------------
% 0.13/0.43 # User time : 0.008 s
% 0.13/0.43 # System time : 0.002 s
% 0.13/0.43 # Total time : 0.010 s
% 0.13/0.43 # Maximum resident set size: 1716 pages
% 0.13/0.43
% 0.13/0.43 # -------------------------------------------------
% 0.13/0.43 # User time : 0.008 s
% 0.13/0.43 # System time : 0.004 s
% 0.13/0.43 # Total time : 0.012 s
% 0.13/0.43 # Maximum resident set size: 1688 pages
% 0.13/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------