TSTP Solution File: SET008+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET008+3 : TPTP v8.2.0. Released v2.2.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:56:48 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 14 unt; 0 def)
% Number of atoms : 67 ( 19 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 24 |; 10 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 4 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(prove_intersection_difference_empty_set,conjecture,
! [X1,X2] : intersection(difference(X1,X2),X2) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_difference_empty_set) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(c_0_6,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(c_0_7,plain,
! [X6] : ~ member(X6,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_8,plain,
! [X15,X16,X17,X18,X19,X20] :
( ( ~ member(X17,X15)
| member(X17,X16)
| X15 != X16 )
& ( ~ member(X18,X16)
| member(X18,X15)
| X15 != X16 )
& ( ~ member(esk3_2(X19,X20),X19)
| ~ member(esk3_2(X19,X20),X20)
| X19 = X20 )
& ( member(esk3_2(X19,X20),X19)
| member(esk3_2(X19,X20),X20)
| X19 = X20 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[equal_member_defn])])])])])])]) ).
fof(c_0_9,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_10,plain,
! [X7,X8,X9] :
( ( member(X9,X7)
| ~ member(X9,intersection(X7,X8)) )
& ( member(X9,X8)
| ~ member(X9,intersection(X7,X8)) )
& ( ~ member(X9,X7)
| ~ member(X9,X8)
| member(X9,intersection(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
cnf(c_0_11,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( member(esk3_2(X1,X2),X1)
| member(esk3_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X12,X13,X14] :
( ( member(X14,X12)
| ~ member(X14,difference(X12,X13)) )
& ( ~ member(X14,X13)
| ~ member(X14,difference(X12,X13)) )
& ( ~ member(X14,X12)
| member(X14,X13)
| member(X14,difference(X12,X13)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( empty_set = X1
| member(esk3_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] : intersection(difference(X1,X2),X2) = empty_set,
inference(assume_negation,[status(cth)],[prove_intersection_difference_empty_set]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( intersection(X1,X2) = empty_set
| member(esk3_2(empty_set,intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X10,X11] : intersection(X10,X11) = intersection(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_20,negated_conjecture,
intersection(difference(esk1_0,esk2_0),esk2_0) != empty_set,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_21,plain,
( intersection(difference(X1,X2),X3) = empty_set
| ~ member(esk3_2(empty_set,intersection(difference(X1,X2),X3)),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
intersection(difference(esk1_0,esk2_0),esk2_0) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( intersection(X1,difference(X2,X3)) = empty_set
| ~ member(esk3_2(empty_set,intersection(X1,difference(X2,X3))),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
intersection(esk2_0,difference(esk1_0,esk2_0)) != empty_set,
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_26,plain,
intersection(X1,difference(X2,X1)) = empty_set,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET008+3 : TPTP v8.2.0. Released v2.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 13:04:37 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.19/0.47 # Version: 3.1.0
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # new_bool_3 with pid 8216 completed with status 0
% 0.19/0.47 # Result found by new_bool_3
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.47 # SAT001_MinMin_p005000_rr_RG with pid 8219 completed with status 0
% 0.19/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 10
% 0.19/0.47 # Removed by relevancy pruning/SinE : 4
% 0.19/0.47 # Initial clauses : 13
% 0.19/0.47 # Removed in clause preprocessing : 2
% 0.19/0.47 # Initial clauses in saturation : 11
% 0.19/0.47 # Processed clauses : 49
% 0.19/0.47 # ...of these trivial : 1
% 0.19/0.47 # ...subsumed : 10
% 0.19/0.47 # ...remaining for further processing : 38
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 2
% 0.19/0.47 # Generated clauses : 95
% 0.19/0.47 # ...of the previous two non-redundant : 67
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 93
% 0.19/0.47 # Factorizations : 2
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 20
% 0.19/0.47 # ...of those cached : 12
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 25
% 0.19/0.47 # Positive orientable unit clauses : 5
% 0.19/0.47 # Positive unorientable unit clauses: 1
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 18
% 0.19/0.47 # Current number of unprocessed clauses: 40
% 0.19/0.47 # ...number of literals in the above : 112
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 13
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 71
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 52
% 0.19/0.47 # Non-unit clause-clause subsumptions : 4
% 0.19/0.47 # Unit Clause-clause subsumption calls : 14
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 9
% 0.19/0.47 # BW rewrite match successes : 5
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 1972
% 0.19/0.47 # Search garbage collected termcells : 222
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.007 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.008 s
% 0.19/0.47 # Maximum resident set size: 1732 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.008 s
% 0.19/0.47 # System time : 0.004 s
% 0.19/0.47 # Total time : 0.011 s
% 0.19/0.47 # Maximum resident set size: 1692 pages
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------