TSTP Solution File: SET597+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET597+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:19:30 EDT 2023
% Result : Timeout 408.26s 300.14s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 14 unt; 0 def)
% Number of atoms : 104 ( 29 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 112 ( 44 ~; 47 |; 15 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 2 sgn; 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th56,conjecture,
! [X1,X2,X3] :
( X1 = union(X2,X3)
<=> ( subset(X2,X1)
& subset(X3,X1)
& ! [X4] :
( ( subset(X2,X4)
& subset(X3,X4) )
=> subset(X1,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.i1JmaUzBxj/E---3.1_13956.p',prove_th56) ).
fof(subset_of_union,axiom,
! [X1,X2] : subset(X1,union(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.i1JmaUzBxj/E---3.1_13956.p',subset_of_union) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.i1JmaUzBxj/E---3.1_13956.p',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.i1JmaUzBxj/E---3.1_13956.p',equal_defn) ).
fof(union_subset,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(union(X1,X3),X2) ),
file('/export/starexec/sandbox/tmp/tmp.i1JmaUzBxj/E---3.1_13956.p',union_subset) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( X1 = union(X2,X3)
<=> ( subset(X2,X1)
& subset(X3,X1)
& ! [X4] :
( ( subset(X2,X4)
& subset(X3,X4) )
=> subset(X1,X4) ) ) ),
inference(assume_negation,[status(cth)],[prove_th56]) ).
fof(c_0_6,negated_conjecture,
! [X9] :
( ( subset(esk2_0,esk4_0)
| ~ subset(esk2_0,esk1_0)
| ~ subset(esk3_0,esk1_0)
| esk1_0 != union(esk2_0,esk3_0) )
& ( subset(esk3_0,esk4_0)
| ~ subset(esk2_0,esk1_0)
| ~ subset(esk3_0,esk1_0)
| esk1_0 != union(esk2_0,esk3_0) )
& ( ~ subset(esk1_0,esk4_0)
| ~ subset(esk2_0,esk1_0)
| ~ subset(esk3_0,esk1_0)
| esk1_0 != union(esk2_0,esk3_0) )
& ( subset(esk2_0,esk1_0)
| esk1_0 = union(esk2_0,esk3_0) )
& ( subset(esk3_0,esk1_0)
| esk1_0 = union(esk2_0,esk3_0) )
& ( ~ subset(esk2_0,X9)
| ~ subset(esk3_0,X9)
| subset(esk1_0,X9)
| esk1_0 = union(esk2_0,esk3_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,plain,
! [X10,X11] : subset(X10,union(X10,X11)),
inference(variable_rename,[status(thm)],[subset_of_union]) ).
fof(c_0_8,plain,
! [X18,X19] : union(X18,X19) = union(X19,X18),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_9,negated_conjecture,
( subset(esk1_0,X1)
| esk1_0 = union(esk2_0,esk3_0)
| ~ subset(esk2_0,X1)
| ~ subset(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
subset(X1,union(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X15,X16] :
( ( subset(X15,X16)
| X15 != X16 )
& ( subset(X16,X15)
| X15 != X16 )
& ( ~ subset(X15,X16)
| ~ subset(X16,X15)
| X15 = X16 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_13,negated_conjecture,
( union(esk2_0,esk3_0) = esk1_0
| subset(esk1_0,union(esk3_0,X1))
| ~ subset(esk2_0,union(esk3_0,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( union(esk2_0,esk3_0) = esk1_0
| subset(esk1_0,union(esk2_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).
fof(c_0_17,plain,
! [X12,X13,X14] :
( ~ subset(X12,X13)
| ~ subset(X14,X13)
| subset(union(X12,X14),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_subset])]) ).
cnf(c_0_18,negated_conjecture,
( subset(esk3_0,esk1_0)
| esk1_0 = union(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( subset(esk2_0,esk1_0)
| esk1_0 = union(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( union(esk2_0,esk3_0) = esk1_0
| ~ subset(union(esk2_0,esk3_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( subset(union(X1,X3),X2)
| ~ subset(X1,X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
subset(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
subset(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( subset(esk3_0,esk4_0)
| ~ subset(esk2_0,esk1_0)
| ~ subset(esk3_0,esk1_0)
| esk1_0 != union(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( subset(esk2_0,esk4_0)
| ~ subset(esk2_0,esk1_0)
| ~ subset(esk3_0,esk1_0)
| esk1_0 != union(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
( ~ subset(esk1_0,esk4_0)
| ~ subset(esk2_0,esk1_0)
| ~ subset(esk3_0,esk1_0)
| esk1_0 != union(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
union(esk2_0,esk3_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( subset(esk3_0,esk4_0)
| union(esk2_0,esk3_0) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
( subset(esk2_0,esk4_0)
| union(esk2_0,esk3_0) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_23]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
( union(esk2_0,esk3_0) != esk1_0
| ~ subset(esk1_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
( subset(esk1_0,X1)
| ~ subset(esk3_0,X1)
| ~ subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
subset(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
subset(esk2_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
~ subset(esk1_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET597+3 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.10/0.33 % Computer : n013.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 2400
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Mon Oct 2 17:08:44 EDT 2023
% 0.10/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.i1JmaUzBxj/E---3.1_13956.p
% 408.26/300.14 # Version: 3.1pre001
% 408.26/300.14 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.26/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.26/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.26/300.14 # Starting new_bool_3 with 300s (1) cores
% 408.26/300.14 # Starting new_bool_1 with 300s (1) cores
% 408.26/300.14 # Starting sh5l with 300s (1) cores
% 408.26/300.14 # new_bool_3 with pid 14035 completed with status 0
% 408.26/300.14 # Result found by new_bool_3
% 408.26/300.14 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.26/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.26/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.26/300.14 # Starting new_bool_3 with 300s (1) cores
% 408.26/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.26/300.14 # Search class: FGHSS-FFSF22-SFFFFFNN
% 408.26/300.14 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.26/300.14 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 408.26/300.14 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 14039 completed with status 0
% 408.26/300.14 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 408.26/300.14 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.26/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.26/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.26/300.14 # Starting new_bool_3 with 300s (1) cores
% 408.26/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.26/300.14 # Search class: FGHSS-FFSF22-SFFFFFNN
% 408.26/300.14 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.26/300.14 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 408.26/300.14 # Preprocessing time : 0.001 s
% 408.26/300.14 # Presaturation interreduction done
% 408.26/300.14
% 408.26/300.14 # Proof found!
% 408.26/300.14 # SZS status Theorem
% 408.26/300.14 # SZS output start CNFRefutation
% See solution above
% 408.26/300.14 # Parsed axioms : 9
% 408.26/300.14 # Removed by relevancy pruning/SinE : 3
% 408.26/300.14 # Initial clauses : 13
% 408.26/300.14 # Removed in clause preprocessing : 0
% 408.26/300.14 # Initial clauses in saturation : 13
% 408.26/300.14 # Processed clauses : 86
% 408.26/300.14 # ...of these trivial : 2
% 408.26/300.14 # ...subsumed : 25
% 408.26/300.14 # ...remaining for further processing : 59
% 408.26/300.14 # Other redundant clauses eliminated : 2
% 408.26/300.14 # Clauses deleted for lack of memory : 0
% 408.26/300.14 # Backward-subsumed : 13
% 408.26/300.14 # Backward-rewritten : 10
% 408.26/300.14 # Generated clauses : 98
% 408.26/300.14 # ...of the previous two non-redundant : 81
% 408.26/300.14 # ...aggressively subsumed : 0
% 408.26/300.14 # Contextual simplify-reflections : 7
% 408.26/300.14 # Paramodulations : 96
% 408.26/300.14 # Factorizations : 0
% 408.26/300.14 # NegExts : 0
% 408.26/300.14 # Equation resolutions : 2
% 408.26/300.14 # Total rewrite steps : 44
% 408.26/300.14 # Propositional unsat checks : 0
% 408.26/300.14 # Propositional check models : 0
% 408.26/300.14 # Propositional check unsatisfiable : 0
% 408.26/300.14 # Propositional clauses : 0
% 408.26/300.14 # Propositional clauses after purity: 0
% 408.26/300.14 # Propositional unsat core size : 0
% 408.26/300.14 # Propositional preprocessing time : 0.000
% 408.26/300.14 # Propositional encoding time : 0.000
% 408.26/300.14 # Propositional solver time : 0.000
% 408.26/300.14 # Success case prop preproc time : 0.000
% 408.26/300.14 # Success case prop encoding time : 0.000
% 408.26/300.14 # Success case prop solver time : 0.000
% 408.26/300.14 # Current number of processed clauses : 23
% 408.26/300.14 # Positive orientable unit clauses : 8
% 408.26/300.14 # Positive unorientable unit clauses: 1
% 408.26/300.14 # Negative unit clauses : 1
% 408.26/300.14 # Non-unit-clauses : 13
% 408.26/300.14 # Current number of unprocessed clauses: 12
% 408.26/300.14 # ...number of literals in the above : 46
% 408.26/300.14 # Current number of archived formulas : 0
% 408.26/300.14 # Current number of archived clauses : 34
% 408.26/300.14 # Clause-clause subsumption calls (NU) : 210
% 408.26/300.14 # Rec. Clause-clause subsumption calls : 182
% 408.26/300.14 # Non-unit clause-clause subsumptions : 39
% 408.26/300.14 # Unit Clause-clause subsumption calls : 13
% 408.26/300.14 # Rewrite failures with RHS unbound : 0
% 408.26/300.14 # BW rewrite match attempts : 14
% 408.26/300.14 # BW rewrite match successes : 11
% 408.26/300.14 # Condensation attempts : 0
% 408.26/300.14 # Condensation successes : 0
% 408.26/300.14 # Termbank termtop insertions : 1602
% 408.26/300.14
% 408.26/300.14 # -------------------------------------------------
% 408.26/300.14 # User time : 0.006 s
% 408.26/300.14 # System time : 0.002 s
% 408.26/300.14 # Total time : 0.007 s
% 408.26/300.14 # Maximum resident set size: 1756 pages
% 408.26/300.14
% 408.26/300.14 # -------------------------------------------------
% 408.26/300.14 # User time : 0.006 s
% 408.26/300.14 # System time : 0.003 s
% 408.26/300.14 # Total time : 0.009 s
% 408.26/300.14 # Maximum resident set size: 1680 pages
% 408.26/300.14 % E---3.1 exiting
% 408.26/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------