TSTP Solution File: SET185+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET185+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:48 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 84 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 72 ( 26 ~; 32 |; 8 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 6 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_subset_union,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> union(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.i3XUmue5XZ/E---3.1_2241.p',prove_subset_union) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i3XUmue5XZ/E---3.1_2241.p',subset_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i3XUmue5XZ/E---3.1_2241.p',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.i3XUmue5XZ/E---3.1_2241.p',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i3XUmue5XZ/E---3.1_2241.p',equal_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> union(X1,X2) = X2 ),
inference(assume_negation,[status(cth)],[prove_subset_union]) ).
fof(c_0_6,plain,
! [X11,X12,X13,X14,X15] :
( ( ~ subset(X11,X12)
| ~ member(X13,X11)
| member(X13,X12) )
& ( member(esk3_2(X14,X15),X14)
| subset(X14,X15) )
& ( ~ member(esk3_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_7,negated_conjecture,
( subset(esk1_0,esk2_0)
& union(esk1_0,esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X6,X7,X8] :
( ( ~ member(X8,union(X6,X7))
| member(X8,X6)
| member(X8,X7) )
& ( ~ member(X8,X6)
| member(X8,union(X6,X7)) )
& ( ~ member(X8,X7)
| member(X8,union(X6,X7)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).
cnf(c_0_9,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( subset(esk1_0,X1)
| member(esk3_2(esk1_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
! [X9,X10] : union(X9,X10) = union(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_18,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
subset(esk1_0,union(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,
( subset(union(X1,X2),X3)
| member(esk3_2(union(X1,X2),X3),X1)
| member(esk3_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,union(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X17,X18] :
( ( subset(X17,X18)
| X17 != X18 )
& ( subset(X18,X17)
| X17 != X18 )
& ( ~ subset(X17,X18)
| ~ subset(X18,X17)
| X17 = X18 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_24,plain,
( subset(union(X1,X1),X2)
| member(esk3_2(union(X1,X1),X2),X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( member(X1,union(esk2_0,X2))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
subset(union(X1,X1),X1),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_29,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( subset(X1,union(esk2_0,X2))
| ~ member(esk3_2(X1,union(esk2_0,X2)),esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_26]) ).
cnf(c_0_31,plain,
union(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( subset(X1,esk2_0)
| ~ member(esk3_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
( subset(union(X1,X2),X2)
| member(esk3_2(union(X1,X2),X2),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
union(esk1_0,esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
subset(union(esk2_0,esk1_0),esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]) ).
cnf(c_0_36,negated_conjecture,
union(esk2_0,esk1_0) != esk2_0,
inference(rw,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_35]),c_0_29])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET185+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:26:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.i3XUmue5XZ/E---3.1_2241.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 2320 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.46 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2323 completed with status 0
% 0.17/0.46 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 7
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 17
% 0.17/0.46 # Removed in clause preprocessing : 2
% 0.17/0.46 # Initial clauses in saturation : 15
% 0.17/0.46 # Processed clauses : 162
% 0.17/0.46 # ...of these trivial : 12
% 0.17/0.46 # ...subsumed : 68
% 0.17/0.46 # ...remaining for further processing : 82
% 0.17/0.46 # Other redundant clauses eliminated : 2
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 3
% 0.17/0.46 # Generated clauses : 449
% 0.17/0.46 # ...of the previous two non-redundant : 378
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 427
% 0.17/0.46 # Factorizations : 20
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 2
% 0.17/0.46 # Total rewrite steps : 85
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 64
% 0.17/0.46 # Positive orientable unit clauses : 16
% 0.17/0.46 # Positive unorientable unit clauses: 1
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 46
% 0.17/0.46 # Current number of unprocessed clauses: 235
% 0.17/0.46 # ...number of literals in the above : 603
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 16
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 433
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 396
% 0.17/0.46 # Non-unit clause-clause subsumptions : 68
% 0.17/0.46 # Unit Clause-clause subsumption calls : 39
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 43
% 0.17/0.46 # BW rewrite match successes : 5
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 5670
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.011 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.012 s
% 0.17/0.46 # Maximum resident set size: 1756 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.013 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.015 s
% 0.17/0.46 # Maximum resident set size: 1676 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------