TSTP Solution File: SET577+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET577+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:58:43 EDT 2024
% Result : Theorem 0.11s 0.40s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 117 ( 13 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 104 ( 36 ~; 50 |; 10 &)
% ( 5 <=>; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 10 sgn 31 !; 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/benchmark/theBenchmark.p',prove_th18) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(c_0_5,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_6,plain,
! [X12,X13,X14,X15,X16] :
( ( ~ subset(X12,X13)
| ~ member(X14,X12)
| member(X14,X13) )
& ( member(esk1_2(X15,X16),X15)
| subset(X15,X16) )
& ( ~ member(esk1_2(X15,X16),X16)
| subset(X15,X16) ) ),
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_7,plain,
! [X5,X6,X7] :
( ( ~ member(X7,union(X5,X6))
| member(X7,X5)
| member(X7,X6) )
& ( ~ member(X7,X5)
| member(X7,union(X5,X6)) )
& ( ~ member(X7,X6)
| member(X7,union(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).
fof(c_0_8,negated_conjecture,
! [X29] :
( ( ~ member(X29,esk3_0)
| member(X29,esk4_0)
| member(X29,esk5_0) )
& ( ~ member(X29,esk4_0)
| member(X29,esk3_0) )
& ( ~ member(X29,esk5_0)
| member(X29,esk3_0) )
& esk3_0 != union(esk4_0,esk5_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_5])])])])])]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( subset(esk5_0,X1)
| member(esk1_2(esk5_0,X1),esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X10,X11] : union(X10,X11) = union(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_17,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( subset(esk4_0,X1)
| member(esk1_2(esk4_0,X1),esk3_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
subset(esk5_0,union(X1,esk3_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( subset(union(X1,X2),X3)
| member(esk1_2(union(X1,X2),X3),X1)
| member(esk1_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,negated_conjecture,
subset(esk4_0,union(X1,esk3_0)),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_23,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
subset(esk5_0,union(esk3_0,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,plain,
! [X8,X9] :
( ( subset(X8,X9)
| X8 != X9 )
& ( subset(X9,X8)
| X8 != X9 )
& ( ~ subset(X8,X9)
| ~ subset(X9,X8)
| X8 = X9 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_26,plain,
( subset(union(X1,X1),X2)
| member(esk1_2(union(X1,X1),X2),X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( member(X1,esk4_0)
| member(X1,esk5_0)
| ~ member(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
subset(esk4_0,union(esk3_0,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( member(X1,union(esk3_0,X2))
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
subset(union(X1,X1),X1),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_33,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_34,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
( subset(esk3_0,X1)
| member(esk1_2(esk3_0,X1),esk5_0)
| member(esk1_2(esk3_0,X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( member(X1,union(esk3_0,X2))
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( subset(X1,union(esk3_0,X2))
| ~ member(esk1_2(X1,union(esk3_0,X2)),esk5_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_30]) ).
cnf(c_0_38,plain,
union(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_39,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( subset(esk3_0,union(X1,esk5_0))
| member(esk1_2(esk3_0,union(X1,esk5_0)),esk4_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( subset(X1,union(esk3_0,X2))
| ~ member(esk1_2(X1,union(esk3_0,X2)),esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( subset(X1,esk3_0)
| ~ member(esk1_2(X1,esk3_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
subset(esk3_0,union(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
esk3_0 != union(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_45,negated_conjecture,
( subset(X1,esk3_0)
| ~ member(esk1_2(X1,esk3_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( subset(union(esk5_0,X1),esk3_0)
| member(esk1_2(union(esk5_0,X1),esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_21]) ).
cnf(c_0_47,negated_conjecture,
~ subset(union(esk4_0,esk5_0),esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_43]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_20]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SET577+3 : TPTP v8.2.0. Released v2.2.0.
% 0.02/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n007.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Mon May 20 11:41:22 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running first-order model finding
% 0.11/0.35 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.11/0.40 # Version: 3.1.0
% 0.11/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.40 # Starting sh5l with 300s (1) cores
% 0.11/0.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25124 completed with status 0
% 0.11/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.40 # No SInE strategy applied
% 0.11/0.40 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.11/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.40 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.11/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.40 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.40 # Starting sh5l with 136s (1) cores
% 0.11/0.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25129 completed with status 0
% 0.11/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.40 # No SInE strategy applied
% 0.11/0.40 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.11/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.40 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.11/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.40 # Preprocessing time : 0.001 s
% 0.11/0.40 # Presaturation interreduction done
% 0.11/0.40
% 0.11/0.40 # Proof found!
% 0.11/0.40 # SZS status Theorem
% 0.11/0.40 # SZS output start CNFRefutation
% See solution above
% 0.11/0.40 # Parsed axioms : 7
% 0.11/0.40 # Removed by relevancy pruning/SinE : 0
% 0.11/0.40 # Initial clauses : 19
% 0.11/0.40 # Removed in clause preprocessing : 2
% 0.11/0.40 # Initial clauses in saturation : 17
% 0.11/0.40 # Processed clauses : 546
% 0.11/0.40 # ...of these trivial : 23
% 0.11/0.40 # ...subsumed : 329
% 0.11/0.40 # ...remaining for further processing : 194
% 0.11/0.40 # Other redundant clauses eliminated : 2
% 0.11/0.40 # Clauses deleted for lack of memory : 0
% 0.11/0.40 # Backward-subsumed : 2
% 0.11/0.40 # Backward-rewritten : 2
% 0.11/0.40 # Generated clauses : 1326
% 0.11/0.40 # ...of the previous two non-redundant : 1175
% 0.11/0.40 # ...aggressively subsumed : 0
% 0.11/0.40 # Contextual simplify-reflections : 4
% 0.11/0.40 # Paramodulations : 1296
% 0.11/0.40 # Factorizations : 28
% 0.11/0.40 # NegExts : 0
% 0.11/0.40 # Equation resolutions : 2
% 0.11/0.40 # Disequality decompositions : 0
% 0.11/0.40 # Total rewrite steps : 180
% 0.11/0.40 # ...of those cached : 112
% 0.11/0.40 # Propositional unsat checks : 0
% 0.11/0.40 # Propositional check models : 0
% 0.11/0.40 # Propositional check unsatisfiable : 0
% 0.11/0.40 # Propositional clauses : 0
% 0.11/0.40 # Propositional clauses after purity: 0
% 0.11/0.40 # Propositional unsat core size : 0
% 0.11/0.40 # Propositional preprocessing time : 0.000
% 0.11/0.40 # Propositional encoding time : 0.000
% 0.11/0.40 # Propositional solver time : 0.000
% 0.11/0.40 # Success case prop preproc time : 0.000
% 0.11/0.40 # Success case prop encoding time : 0.000
% 0.11/0.40 # Success case prop solver time : 0.000
% 0.11/0.40 # Current number of processed clauses : 173
% 0.11/0.40 # Positive orientable unit clauses : 27
% 0.11/0.40 # Positive unorientable unit clauses: 1
% 0.11/0.40 # Negative unit clauses : 2
% 0.11/0.40 # Non-unit-clauses : 143
% 0.11/0.40 # Current number of unprocessed clauses: 630
% 0.11/0.40 # ...number of literals in the above : 1744
% 0.11/0.40 # Current number of archived formulas : 0
% 0.11/0.40 # Current number of archived clauses : 19
% 0.11/0.40 # Clause-clause subsumption calls (NU) : 4188
% 0.11/0.40 # Rec. Clause-clause subsumption calls : 3464
% 0.11/0.40 # Non-unit clause-clause subsumptions : 331
% 0.11/0.40 # Unit Clause-clause subsumption calls : 178
% 0.11/0.40 # Rewrite failures with RHS unbound : 0
% 0.11/0.40 # BW rewrite match attempts : 90
% 0.11/0.40 # BW rewrite match successes : 7
% 0.11/0.40 # Condensation attempts : 0
% 0.11/0.40 # Condensation successes : 0
% 0.11/0.40 # Termbank termtop insertions : 18474
% 0.11/0.40 # Search garbage collected termcells : 355
% 0.11/0.40
% 0.11/0.40 # -------------------------------------------------
% 0.11/0.40 # User time : 0.030 s
% 0.11/0.40 # System time : 0.005 s
% 0.11/0.40 # Total time : 0.035 s
% 0.11/0.40 # Maximum resident set size: 1720 pages
% 0.11/0.40
% 0.11/0.40 # -------------------------------------------------
% 0.11/0.40 # User time : 0.155 s
% 0.11/0.40 # System time : 0.010 s
% 0.11/0.40 # Total time : 0.165 s
% 0.11/0.40 # Maximum resident set size: 1688 pages
% 0.11/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------