TSTP Solution File: SET584+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET584+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:54:23 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 53 ( 19 ~; 24 |; 5 &)
% ( 2 <=>; 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 : 58 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th33,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(union(X1,X3),union(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th33) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(union(X1,X3),union(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_th33]) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ member(X9,X7)
| member(X9,X8) )
& ( member(esk1_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ member(esk1_2(X10,X11),X11)
| subset(X10,X11) ) ),
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_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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).
fof(c_0_7,negated_conjecture,
( subset(esk3_0,esk4_0)
& ~ subset(union(esk3_0,esk5_0),union(esk4_0,esk5_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( subset(X1,union(X2,esk4_0))
| ~ member(esk1_2(X1,union(X2,esk4_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,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_14,c_0_15]) ).
cnf(c_0_19,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( subset(union(esk3_0,X1),union(X2,esk4_0))
| member(esk1_2(union(esk3_0,X1),union(X2,esk4_0)),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X13,X14] : union(X13,X14) = union(X14,X13),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_22,negated_conjecture,
subset(union(esk3_0,X1),union(X1,esk4_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ subset(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
subset(union(esk3_0,X1),union(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET584+3 : TPTP v8.2.0. Released v2.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 11:45:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 15124 completed with status 0
% 0.19/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.51 # Starting sh5l with 136s (1) cores
% 0.19/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 15131 completed with status 0
% 0.19/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 6
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 14
% 0.19/0.51 # Removed in clause preprocessing : 2
% 0.19/0.51 # Initial clauses in saturation : 12
% 0.19/0.51 # Processed clauses : 218
% 0.19/0.51 # ...of these trivial : 25
% 0.19/0.51 # ...subsumed : 86
% 0.19/0.51 # ...remaining for further processing : 107
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 1
% 0.19/0.51 # Generated clauses : 823
% 0.19/0.51 # ...of the previous two non-redundant : 702
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 8
% 0.19/0.51 # Paramodulations : 801
% 0.19/0.51 # Factorizations : 22
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 128
% 0.19/0.51 # ...of those cached : 78
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 106
% 0.19/0.51 # Positive orientable unit clauses : 43
% 0.19/0.51 # Positive unorientable unit clauses: 1
% 0.19/0.51 # Negative unit clauses : 0
% 0.19/0.51 # Non-unit-clauses : 62
% 0.19/0.51 # Current number of unprocessed clauses: 496
% 0.19/0.51 # ...number of literals in the above : 1315
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 1
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 839
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 793
% 0.19/0.51 # Non-unit clause-clause subsumptions : 94
% 0.19/0.51 # Unit Clause-clause subsumption calls : 117
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 123
% 0.19/0.51 # BW rewrite match successes : 5
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 11827
% 0.19/0.51 # Search garbage collected termcells : 255
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.026 s
% 0.19/0.51 # System time : 0.001 s
% 0.19/0.51 # Total time : 0.027 s
% 0.19/0.51 # Maximum resident set size: 1736 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.113 s
% 0.19/0.51 # System time : 0.008 s
% 0.19/0.51 # Total time : 0.121 s
% 0.19/0.51 # Maximum resident set size: 1692 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------