TSTP Solution File: SET159+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET159+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:42 EDT 2023
% Result : Theorem 2.92s 0.80s
% Output : CNFRefutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 78 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 72 ( 28 ~; 33 |; 7 &)
% ( 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 : 89 ( 4 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ix3qh9b1OJ/E---3.1_26892.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.ix3qh9b1OJ/E---3.1_26892.p',union_defn) ).
fof(prove_associativity_of_union,conjecture,
! [X1,X2,X3] : union(union(X1,X2),X3) = union(X1,union(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ix3qh9b1OJ/E---3.1_26892.p',prove_associativity_of_union) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ix3qh9b1OJ/E---3.1_26892.p',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ix3qh9b1OJ/E---3.1_26892.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,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_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,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_14,plain,
( subset(union(X1,X2),X3)
| member(esk1_2(union(X1,X2),X3),X2)
| member(esk1_2(union(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( subset(X1,union(X2,union(X3,X4)))
| ~ member(esk1_2(X1,union(X2,union(X3,X4))),X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_16,plain,
( subset(union(X1,X2),union(X1,X3))
| member(esk1_2(union(X1,X2),union(X1,X3)),X2) ),
inference(spm,[status(thm)],[c_0_13,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(union(X1,X2),union(X1,union(X3,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2,X3] : union(union(X1,X2),X3) = union(X1,union(X2,X3)),
inference(assume_negation,[status(cth)],[prove_associativity_of_union]) ).
cnf(c_0_20,plain,
( member(X1,union(X2,union(X3,X4)))
| ~ member(X1,union(X2,X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( subset(X1,union(X2,union(X3,X4)))
| ~ member(esk1_2(X1,union(X2,union(X3,X4))),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
fof(c_0_22,negated_conjecture,
union(union(esk3_0,esk4_0),esk5_0) != union(esk3_0,union(esk4_0,esk5_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_23,plain,
! [X9,X10] : union(X9,X10) = union(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
fof(c_0_24,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_25,plain,
( subset(X1,union(X2,union(X3,X4)))
| ~ member(esk1_2(X1,union(X2,union(X3,X4))),union(X2,X4)) ),
inference(spm,[status(thm)],[c_0_7,c_0_20]) ).
cnf(c_0_26,plain,
( subset(union(X1,X2),union(X3,union(X1,X4)))
| member(esk1_2(union(X1,X2),union(X3,union(X1,X4))),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_27,negated_conjecture,
union(union(esk3_0,esk4_0),esk5_0) != union(esk3_0,union(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
subset(union(X1,union(X2,X3)),union(X2,union(X1,X3))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
union(esk5_0,union(esk3_0,esk4_0)) != union(esk3_0,union(esk4_0,esk5_0)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
union(X1,union(X2,X3)) = union(X2,union(X1,X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET159+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 17:41:49 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.ix3qh9b1OJ/E---3.1_26892.p
% 2.92/0.80 # Version: 3.1pre001
% 2.92/0.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.92/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/0.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.92/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.92/0.80 # Starting new_bool_1 with 300s (1) cores
% 2.92/0.80 # Starting sh5l with 300s (1) cores
% 2.92/0.80 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26987 completed with status 0
% 2.92/0.80 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.92/0.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.92/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/0.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.92/0.80 # No SInE strategy applied
% 2.92/0.80 # Search class: FGUSS-FFSF22-SFFFFFNN
% 2.92/0.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.92/0.80 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.92/0.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.92/0.80 # Starting new_bool_3 with 136s (1) cores
% 2.92/0.80 # Starting new_bool_1 with 136s (1) cores
% 2.92/0.80 # Starting sh5l with 136s (1) cores
% 2.92/0.80 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26992 completed with status 0
% 2.92/0.80 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.92/0.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.92/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/0.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.92/0.80 # No SInE strategy applied
% 2.92/0.80 # Search class: FGUSS-FFSF22-SFFFFFNN
% 2.92/0.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.92/0.80 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.92/0.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.92/0.80 # Preprocessing time : 0.001 s
% 2.92/0.80
% 2.92/0.80 # Proof found!
% 2.92/0.80 # SZS status Theorem
% 2.92/0.80 # SZS output start CNFRefutation
% See solution above
% 2.92/0.80 # Parsed axioms : 7
% 2.92/0.80 # Removed by relevancy pruning/SinE : 0
% 2.92/0.80 # Initial clauses : 16
% 2.92/0.80 # Removed in clause preprocessing : 2
% 2.92/0.80 # Initial clauses in saturation : 14
% 2.92/0.80 # Processed clauses : 2785
% 2.92/0.80 # ...of these trivial : 483
% 2.92/0.80 # ...subsumed : 1916
% 2.92/0.80 # ...remaining for further processing : 386
% 2.92/0.80 # Other redundant clauses eliminated : 2
% 2.92/0.80 # Clauses deleted for lack of memory : 0
% 2.92/0.80 # Backward-subsumed : 5
% 2.92/0.80 # Backward-rewritten : 25
% 2.92/0.80 # Generated clauses : 32050
% 2.92/0.80 # ...of the previous two non-redundant : 22638
% 2.92/0.80 # ...aggressively subsumed : 0
% 2.92/0.80 # Contextual simplify-reflections : 2
% 2.92/0.80 # Paramodulations : 32010
% 2.92/0.80 # Factorizations : 38
% 2.92/0.80 # NegExts : 0
% 2.92/0.80 # Equation resolutions : 2
% 2.92/0.80 # Total rewrite steps : 12353
% 2.92/0.80 # Propositional unsat checks : 0
% 2.92/0.80 # Propositional check models : 0
% 2.92/0.80 # Propositional check unsatisfiable : 0
% 2.92/0.80 # Propositional clauses : 0
% 2.92/0.80 # Propositional clauses after purity: 0
% 2.92/0.80 # Propositional unsat core size : 0
% 2.92/0.80 # Propositional preprocessing time : 0.000
% 2.92/0.80 # Propositional encoding time : 0.000
% 2.92/0.80 # Propositional solver time : 0.000
% 2.92/0.80 # Success case prop preproc time : 0.000
% 2.92/0.80 # Success case prop encoding time : 0.000
% 2.92/0.80 # Success case prop solver time : 0.000
% 2.92/0.80 # Current number of processed clauses : 354
% 2.92/0.80 # Positive orientable unit clauses : 119
% 2.92/0.80 # Positive unorientable unit clauses: 3
% 2.92/0.80 # Negative unit clauses : 0
% 2.92/0.80 # Non-unit-clauses : 232
% 2.92/0.80 # Current number of unprocessed clauses: 19785
% 2.92/0.80 # ...number of literals in the above : 39309
% 2.92/0.80 # Current number of archived formulas : 0
% 2.92/0.80 # Current number of archived clauses : 30
% 2.92/0.80 # Clause-clause subsumption calls (NU) : 20502
% 2.92/0.80 # Rec. Clause-clause subsumption calls : 20271
% 2.92/0.80 # Non-unit clause-clause subsumptions : 1867
% 2.92/0.80 # Unit Clause-clause subsumption calls : 2120
% 2.92/0.80 # Rewrite failures with RHS unbound : 0
% 2.92/0.80 # BW rewrite match attempts : 2357
% 2.92/0.80 # BW rewrite match successes : 323
% 2.92/0.80 # Condensation attempts : 0
% 2.92/0.80 # Condensation successes : 0
% 2.92/0.80 # Termbank termtop insertions : 373562
% 2.92/0.80
% 2.92/0.80 # -------------------------------------------------
% 2.92/0.80 # User time : 0.364 s
% 2.92/0.80 # System time : 0.012 s
% 2.92/0.80 # Total time : 0.376 s
% 2.92/0.80 # Maximum resident set size: 1724 pages
% 2.92/0.80
% 2.92/0.80 # -------------------------------------------------
% 2.92/0.80 # User time : 1.849 s
% 2.92/0.80 # System time : 0.029 s
% 2.92/0.80 # Total time : 1.878 s
% 2.92/0.80 # Maximum resident set size: 1676 pages
% 2.92/0.80 % E---3.1 exiting
% 2.92/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------