TSTP Solution File: SET143+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET143+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:18:38 EDT 2023
% Result : Theorem 3.71s 0.95s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 81 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 74 ( 30 ~; 32 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 4 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.wLcmZg4GoF/E---3.1_29622.p',subset_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.wLcmZg4GoF/E---3.1_29622.p',intersection_defn) ).
fof(prove_associativity_of_intersection,conjecture,
! [X1,X2,X3] : intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.wLcmZg4GoF/E---3.1_29622.p',prove_associativity_of_intersection) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.wLcmZg4GoF/E---3.1_29622.p',commutativity_of_intersection) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.wLcmZg4GoF/E---3.1_29622.p',equal_defn) ).
fof(c_0_5,plain,
! [X11,X12,X13,X14,X15] :
( ( ~ subset(X11,X12)
| ~ member(X13,X11)
| member(X13,X12) )
& ( member(esk1_2(X14,X15),X14)
| subset(X14,X15) )
& ( ~ member(esk1_2(X14,X15),X15)
| subset(X14,X15) ) ),
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)],[subset_defn])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| ~ member(esk1_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( subset(intersection(X1,X2),X3)
| member(esk1_2(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( subset(intersection(X1,X2),X3)
| member(esk1_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_15,plain,
( subset(intersection(X1,X2),intersection(X3,X1))
| ~ member(esk1_2(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( subset(intersection(X1,intersection(X2,X3)),X4)
| member(esk1_2(intersection(X1,intersection(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
subset(intersection(X1,intersection(X2,X3)),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( subset(intersection(X1,intersection(X2,X3)),X4)
| member(esk1_2(intersection(X1,intersection(X2,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_20,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,intersection(X3,intersection(X2,X4))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X2,X3] : intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
inference(assume_negation,[status(cth)],[prove_associativity_of_intersection]) ).
cnf(c_0_22,plain,
( subset(intersection(X1,intersection(X2,X3)),intersection(X4,X3))
| ~ member(esk1_2(intersection(X1,intersection(X2,X3)),intersection(X4,X3)),X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_23,plain,
( subset(intersection(X1,intersection(X2,X3)),X4)
| member(esk1_2(intersection(X1,intersection(X2,X3)),X4),intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
fof(c_0_24,plain,
! [X9,X10] : intersection(X9,X10) = intersection(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_25,negated_conjecture,
intersection(intersection(esk3_0,esk4_0),esk5_0) != intersection(esk3_0,intersection(esk4_0,esk5_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
fof(c_0_26,plain,
! [X7,X8] :
( ( subset(X7,X8)
| X7 != X8 )
& ( subset(X8,X7)
| X7 != X8 )
& ( ~ subset(X7,X8)
| ~ subset(X8,X7)
| X7 = X8 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_27,plain,
subset(intersection(X1,intersection(X2,X3)),intersection(intersection(X2,X1),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,
intersection(intersection(esk3_0,esk4_0),esk5_0) != intersection(esk3_0,intersection(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
subset(intersection(X1,intersection(X2,X3)),intersection(X3,intersection(X2,X1))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
intersection(esk5_0,intersection(esk3_0,esk4_0)) != intersection(esk3_0,intersection(esk4_0,esk5_0)),
inference(rw,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_33,plain,
intersection(X1,intersection(X2,X3)) = intersection(X3,intersection(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
intersection(esk4_0,intersection(esk3_0,esk5_0)) != intersection(esk3_0,intersection(esk4_0,esk5_0)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
intersection(X1,intersection(X2,X3)) = intersection(X3,intersection(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SET143+3 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:10:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.wLcmZg4GoF/E---3.1_29622.p
% 3.71/0.95 # Version: 3.1pre001
% 3.71/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.71/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.71/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.71/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.71/0.95 # Starting new_bool_1 with 300s (1) cores
% 3.71/0.95 # Starting sh5l with 300s (1) cores
% 3.71/0.95 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29700 completed with status 0
% 3.71/0.95 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.71/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.71/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.71/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.71/0.95 # No SInE strategy applied
% 3.71/0.95 # Search class: FGUSS-FFSF22-SFFFFFNN
% 3.71/0.95 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.71/0.95 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.71/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.71/0.95 # Starting new_bool_3 with 136s (1) cores
% 3.71/0.95 # Starting new_bool_1 with 136s (1) cores
% 3.71/0.95 # Starting sh5l with 136s (1) cores
% 3.71/0.95 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29706 completed with status 0
% 3.71/0.95 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.71/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.71/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.71/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.71/0.95 # No SInE strategy applied
% 3.71/0.95 # Search class: FGUSS-FFSF22-SFFFFFNN
% 3.71/0.95 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.71/0.95 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.71/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.71/0.95 # Preprocessing time : 0.001 s
% 3.71/0.95
% 3.71/0.95 # Proof found!
% 3.71/0.95 # SZS status Theorem
% 3.71/0.95 # SZS output start CNFRefutation
% See solution above
% 3.71/0.95 # Parsed axioms : 7
% 3.71/0.95 # Removed by relevancy pruning/SinE : 0
% 3.71/0.95 # Initial clauses : 16
% 3.71/0.95 # Removed in clause preprocessing : 2
% 3.71/0.95 # Initial clauses in saturation : 14
% 3.71/0.95 # Processed clauses : 3217
% 3.71/0.95 # ...of these trivial : 695
% 3.71/0.95 # ...subsumed : 2150
% 3.71/0.95 # ...remaining for further processing : 372
% 3.71/0.95 # Other redundant clauses eliminated : 2
% 3.71/0.95 # Clauses deleted for lack of memory : 0
% 3.71/0.95 # Backward-subsumed : 0
% 3.71/0.95 # Backward-rewritten : 171
% 3.71/0.95 # Generated clauses : 36207
% 3.71/0.95 # ...of the previous two non-redundant : 28646
% 3.71/0.95 # ...aggressively subsumed : 0
% 3.71/0.95 # Contextual simplify-reflections : 2
% 3.71/0.95 # Paramodulations : 36147
% 3.71/0.95 # Factorizations : 58
% 3.71/0.95 # NegExts : 0
% 3.71/0.95 # Equation resolutions : 2
% 3.71/0.95 # Total rewrite steps : 11985
% 3.71/0.95 # Propositional unsat checks : 0
% 3.71/0.95 # Propositional check models : 0
% 3.71/0.95 # Propositional check unsatisfiable : 0
% 3.71/0.95 # Propositional clauses : 0
% 3.71/0.95 # Propositional clauses after purity: 0
% 3.71/0.95 # Propositional unsat core size : 0
% 3.71/0.95 # Propositional preprocessing time : 0.000
% 3.71/0.95 # Propositional encoding time : 0.000
% 3.71/0.95 # Propositional solver time : 0.000
% 3.71/0.95 # Success case prop preproc time : 0.000
% 3.71/0.95 # Success case prop encoding time : 0.000
% 3.71/0.95 # Success case prop solver time : 0.000
% 3.71/0.95 # Current number of processed clauses : 199
% 3.71/0.95 # Positive orientable unit clauses : 52
% 3.71/0.95 # Positive unorientable unit clauses: 3
% 3.71/0.95 # Negative unit clauses : 0
% 3.71/0.95 # Non-unit-clauses : 144
% 3.71/0.95 # Current number of unprocessed clauses: 25383
% 3.71/0.95 # ...number of literals in the above : 52949
% 3.71/0.95 # Current number of archived formulas : 0
% 3.71/0.95 # Current number of archived clauses : 171
% 3.71/0.95 # Clause-clause subsumption calls (NU) : 28711
% 3.71/0.95 # Rec. Clause-clause subsumption calls : 21877
% 3.71/0.95 # Non-unit clause-clause subsumptions : 2091
% 3.71/0.95 # Unit Clause-clause subsumption calls : 2746
% 3.71/0.95 # Rewrite failures with RHS unbound : 0
% 3.71/0.95 # BW rewrite match attempts : 1755
% 3.71/0.95 # BW rewrite match successes : 312
% 3.71/0.95 # Condensation attempts : 0
% 3.71/0.95 # Condensation successes : 0
% 3.71/0.95 # Termbank termtop insertions : 448647
% 3.71/0.95
% 3.71/0.95 # -------------------------------------------------
% 3.71/0.95 # User time : 0.427 s
% 3.71/0.95 # System time : 0.021 s
% 3.71/0.95 # Total time : 0.448 s
% 3.71/0.95 # Maximum resident set size: 1720 pages
% 3.71/0.95
% 3.71/0.95 # -------------------------------------------------
% 3.71/0.95 # User time : 2.175 s
% 3.71/0.95 # System time : 0.048 s
% 3.71/0.95 # Total time : 2.223 s
% 3.71/0.95 # Maximum resident set size: 1672 pages
% 3.71/0.95 % E---3.1 exiting
% 3.71/0.95 % E---3.1 exiting
%------------------------------------------------------------------------------