TSTP Solution File: SET577+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET577+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 09:19:01 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 132 ( 22 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 126 ( 40 ~; 63 |; 13 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 87 ( 3 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th18,conjecture,
! [X1,X2,X3] :
( ! [X4] :
( member(X4,X1)
<=> ( member(X4,X2)
| member(X4,X3) ) )
=> X1 = union(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.l3rEVqOe9q/E---3.1_9701.p',prove_th18) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3rEVqOe9q/E---3.1_9701.p',subset_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3rEVqOe9q/E---3.1_9701.p',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.l3rEVqOe9q/E---3.1_9701.p',commutativity_of_union) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3rEVqOe9q/E---3.1_9701.p',equal_member_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3rEVqOe9q/E---3.1_9701.p',equal_defn) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ! [X4] :
( member(X4,X1)
<=> ( member(X4,X2)
| member(X4,X3) ) )
=> X1 = union(X2,X3) ),
inference(assume_negation,[status(cth)],[prove_th18]) ).
fof(c_0_7,plain,
! [X14,X15,X16,X17,X18] :
( ( ~ subset(X14,X15)
| ~ member(X16,X14)
| member(X16,X15) )
& ( member(esk4_2(X17,X18),X17)
| subset(X17,X18) )
& ( ~ member(esk4_2(X17,X18),X18)
| subset(X17,X18) ) ),
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)],[subset_defn])])])])])])]) ).
fof(c_0_8,plain,
! [X9,X10,X11] :
( ( ~ member(X11,union(X9,X10))
| member(X11,X9)
| member(X11,X10) )
& ( ~ member(X11,X9)
| member(X11,union(X9,X10)) )
& ( ~ member(X11,X10)
| member(X11,union(X9,X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).
fof(c_0_9,negated_conjecture,
! [X8] :
( ( ~ member(X8,esk1_0)
| member(X8,esk2_0)
| member(X8,esk3_0) )
& ( ~ member(X8,esk2_0)
| member(X8,esk1_0) )
& ( ~ member(X8,esk3_0)
| member(X8,esk1_0) )
& esk1_0 != union(esk2_0,esk3_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( member(X1,esk2_0)
| member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( member(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( subset(X1,union(X2,X3))
| ~ member(esk4_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( subset(esk1_0,X1)
| member(esk4_2(esk1_0,X1),esk3_0)
| member(esk4_2(esk1_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X12,X13] : union(X12,X13) = union(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_18,plain,
( subset(X1,union(X2,X3))
| ~ member(esk4_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( subset(esk1_0,union(esk3_0,X1))
| member(esk4_2(esk1_0,union(esk3_0,X1)),esk2_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,union(esk2_0,esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_24,plain,
! [X20,X21,X22,X23,X24,X25] :
( ( ~ member(X22,X20)
| member(X22,X21)
| X20 != X21 )
& ( ~ member(X23,X21)
| member(X23,X20)
| X20 != X21 )
& ( ~ member(esk5_2(X24,X25),X24)
| ~ member(esk5_2(X24,X25),X25)
| X24 = X25 )
& ( member(esk5_2(X24,X25),X24)
| member(esk5_2(X24,X25),X25)
| X24 = X25 ) ),
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])])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( member(X1,union(esk2_0,esk3_0))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( subset(union(X1,X2),X3)
| member(esk4_2(union(X1,X2),X3),X1)
| member(esk4_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_27,plain,
( member(esk5_2(X1,X2),X1)
| member(esk5_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_28,plain,
! [X27,X28] :
( ( subset(X27,X28)
| X27 != X28 )
& ( subset(X28,X27)
| X27 != X28 )
& ( ~ subset(X27,X28)
| ~ subset(X28,X27)
| X27 = X28 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_29,negated_conjecture,
( subset(X1,union(esk2_0,esk3_0))
| ~ member(esk4_2(X1,union(esk2_0,esk3_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_25]) ).
cnf(c_0_30,plain,
( subset(union(X1,X2),X2)
| member(esk4_2(union(X1,X2),X2),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk1_0 = X1
| member(esk5_2(esk1_0,X1),esk3_0)
| member(esk5_2(esk1_0,X1),esk2_0)
| member(esk5_2(esk1_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_32,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
subset(union(esk1_0,union(esk2_0,esk3_0)),union(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_35,negated_conjecture,
( union(X1,X2) = esk1_0
| member(esk5_2(esk1_0,union(X1,X2)),esk2_0)
| member(esk5_2(esk1_0,union(X1,X2)),esk3_0)
| member(esk5_2(esk1_0,union(X1,X2)),X1)
| member(esk5_2(esk1_0,union(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
union(esk1_0,union(esk2_0,esk3_0)) = union(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
esk1_0 != union(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,negated_conjecture,
member(esk5_2(esk1_0,union(esk2_0,esk3_0)),union(esk2_0,esk3_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_12]),c_0_14]),c_0_11]) ).
cnf(c_0_39,plain,
( X1 = X2
| ~ member(esk5_2(X1,X2),X1)
| ~ member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
( member(esk5_2(esk1_0,union(esk2_0,esk3_0)),esk2_0)
| member(esk5_2(esk1_0,union(esk2_0,esk3_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
~ member(esk5_2(esk1_0,union(esk2_0,esk3_0)),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_44,negated_conjecture,
member(esk5_2(esk1_0,union(esk2_0,esk3_0)),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET577+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n006.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri May 3 10:05:34 EDT 2024
% 0.14/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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.l3rEVqOe9q/E---3.1_9701.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # sh5l with pid 9793 completed with status 0
% 0.20/0.50 # Result found by sh5l
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 9804 completed with status 0
% 0.20/0.50 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 7
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 19
% 0.20/0.50 # Removed in clause preprocessing : 2
% 0.20/0.50 # Initial clauses in saturation : 17
% 0.20/0.50 # Processed clauses : 449
% 0.20/0.50 # ...of these trivial : 130
% 0.20/0.50 # ...subsumed : 131
% 0.20/0.50 # ...remaining for further processing : 188
% 0.20/0.50 # Other redundant clauses eliminated : 2
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 20
% 0.20/0.50 # Generated clauses : 2657
% 0.20/0.50 # ...of the previous two non-redundant : 1525
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 7
% 0.20/0.50 # Paramodulations : 2601
% 0.20/0.50 # Factorizations : 54
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 2
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 1765
% 0.20/0.50 # ...of those cached : 1421
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 150
% 0.20/0.50 # Positive orientable unit clauses : 62
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 84
% 0.20/0.50 # Current number of unprocessed clauses: 1074
% 0.20/0.50 # ...number of literals in the above : 2474
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 36
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 1231
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 786
% 0.20/0.50 # Non-unit clause-clause subsumptions : 138
% 0.20/0.50 # Unit Clause-clause subsumption calls : 103
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 244
% 0.20/0.50 # BW rewrite match successes : 22
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 26220
% 0.20/0.50 # Search garbage collected termcells : 355
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.035 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.040 s
% 0.20/0.50 # Maximum resident set size: 1716 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.035 s
% 0.20/0.50 # System time : 0.008 s
% 0.20/0.50 # Total time : 0.043 s
% 0.20/0.50 # Maximum resident set size: 1688 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------