TSTP Solution File: SET588+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET588+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:27 EDT 2023
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 59 ( 22 ~; 24 |; 7 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 2 sgn; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_difference_subset1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.nxZNeGbNhN/E---3.1_12135.p',prove_difference_subset1) ).
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nxZNeGbNhN/E---3.1_12135.p',difference_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nxZNeGbNhN/E---3.1_12135.p',subset_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_difference_subset1]) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[difference_defn]) ).
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(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,negated_conjecture,
( subset(esk2_0,esk3_0)
& ~ subset(difference(esk2_0,esk4_0),difference(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( member(X1,difference(esk3_0,X2))
| member(X1,X2)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( subset(difference(X1,X2),X3)
| member(esk1_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( subset(difference(esk2_0,X1),X2)
| member(esk1_2(difference(esk2_0,X1),X2),difference(esk3_0,X3))
| member(esk1_2(difference(esk2_0,X1),X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk1_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( subset(difference(esk2_0,X1),difference(esk3_0,X2))
| member(esk1_2(difference(esk2_0,X1),difference(esk3_0,X2)),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ subset(difference(esk2_0,esk4_0),difference(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
subset(difference(esk2_0,X1),difference(esk3_0,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET588+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 16:48:07 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.nxZNeGbNhN/E---3.1_12135.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12213 completed with status 0
% 0.22/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.54 # Starting sh5l with 136s (1) cores
% 0.22/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12219 completed with status 0
% 0.22/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 4
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 9
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 9
% 0.22/0.54 # Processed clauses : 189
% 0.22/0.54 # ...of these trivial : 8
% 0.22/0.54 # ...subsumed : 63
% 0.22/0.54 # ...remaining for further processing : 118
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 3
% 0.22/0.54 # Backward-rewritten : 3
% 0.22/0.54 # Generated clauses : 678
% 0.22/0.54 # ...of the previous two non-redundant : 614
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 6
% 0.22/0.54 # Paramodulations : 676
% 0.22/0.54 # Factorizations : 2
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Total rewrite steps : 61
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 112
% 0.22/0.54 # Positive orientable unit clauses : 45
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 2
% 0.22/0.54 # Non-unit-clauses : 65
% 0.22/0.54 # Current number of unprocessed clauses: 411
% 0.22/0.54 # ...number of literals in the above : 911
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 6
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 959
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 852
% 0.22/0.54 # Non-unit clause-clause subsumptions : 68
% 0.22/0.54 # Unit Clause-clause subsumption calls : 175
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 192
% 0.22/0.54 # BW rewrite match successes : 3
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 10970
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.018 s
% 0.22/0.54 # System time : 0.002 s
% 0.22/0.54 # Total time : 0.021 s
% 0.22/0.54 # Maximum resident set size: 1692 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.076 s
% 0.22/0.54 # System time : 0.007 s
% 0.22/0.54 # Total time : 0.084 s
% 0.22/0.54 # Maximum resident set size: 1676 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------