TSTP Solution File: SET587+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET587+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 83 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 86 ( 37 ~; 32 |; 10 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 60 ( 5 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.I6nR24jUdT/E---3.1_24074.p',difference_defn) ).
fof(prove_difference_empty_set,conjecture,
! [X1,X2] :
( difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.I6nR24jUdT/E---3.1_24074.p',prove_difference_empty_set) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/tmp.I6nR24jUdT/E---3.1_24074.p',empty_set_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.I6nR24jUdT/E---3.1_24074.p',subset_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.I6nR24jUdT/E---3.1_24074.p',equal_defn) ).
fof(c_0_5,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_6,negated_conjecture,
~ ! [X1,X2] :
( difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[prove_difference_empty_set]) ).
fof(c_0_7,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(c_0_8,plain,
! [X16,X17,X18] :
( ( member(X18,X16)
| ~ member(X18,difference(X16,X17)) )
& ( ~ member(X18,X17)
| ~ member(X18,difference(X16,X17)) )
& ( ~ member(X18,X16)
| member(X18,X17)
| member(X18,difference(X16,X17)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,negated_conjecture,
( ( difference(esk1_0,esk2_0) != empty_set
| ~ subset(esk1_0,esk2_0) )
& ( difference(esk1_0,esk2_0) = empty_set
| subset(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X15] : ~ member(X15,empty_set),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk3_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk3_2(X9,X10),X10)
| subset(X9,X10) ) ),
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])])])])])]) ).
cnf(c_0_12,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( difference(esk1_0,esk2_0) = empty_set
| subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).
fof(c_0_20,plain,
! [X12,X13] :
( ( subset(X12,X13)
| X12 != X13 )
& ( subset(X13,X12)
| X12 != X13 )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| X12 = X13 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_21,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( subset(X1,esk2_0)
| ~ member(esk3_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( subset(difference(X1,esk2_0),X2)
| ~ member(esk3_2(difference(X1,esk2_0),X2),esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_27,plain,
( subset(difference(X1,X2),X3)
| member(esk3_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_28,negated_conjecture,
( difference(esk1_0,esk2_0) != empty_set
| ~ subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_30,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
subset(difference(esk1_0,esk2_0),X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
difference(esk1_0,esk2_0) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET587+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 16:21:59 EDT 2023
% 0.11/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.I6nR24jUdT/E---3.1_24074.p
% 0.18/0.45 # Version: 3.1pre001
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # new_bool_3 with pid 24154 completed with status 0
% 0.18/0.45 # Result found by new_bool_3
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # SAT001_MinMin_p005000_rr_RG with pid 24162 completed with status 0
% 0.18/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Theorem
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 9
% 0.18/0.45 # Removed by relevancy pruning/SinE : 1
% 0.18/0.45 # Initial clauses : 19
% 0.18/0.45 # Removed in clause preprocessing : 2
% 0.18/0.45 # Initial clauses in saturation : 17
% 0.18/0.45 # Processed clauses : 48
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 4
% 0.18/0.45 # ...remaining for further processing : 44
% 0.18/0.45 # Other redundant clauses eliminated : 2
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 0
% 0.18/0.45 # Backward-rewritten : 2
% 0.18/0.45 # Generated clauses : 38
% 0.18/0.45 # ...of the previous two non-redundant : 29
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 1
% 0.18/0.45 # Paramodulations : 36
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 2
% 0.18/0.45 # Total rewrite steps : 5
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 25
% 0.18/0.45 # Positive orientable unit clauses : 5
% 0.18/0.45 # Positive unorientable unit clauses: 0
% 0.18/0.45 # Negative unit clauses : 2
% 0.18/0.45 # Non-unit-clauses : 18
% 0.18/0.45 # Current number of unprocessed clauses: 13
% 0.18/0.45 # ...number of literals in the above : 31
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 17
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 38
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 35
% 0.18/0.45 # Non-unit clause-clause subsumptions : 2
% 0.18/0.45 # Unit Clause-clause subsumption calls : 3
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 1
% 0.18/0.45 # BW rewrite match successes : 1
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 1517
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.005 s
% 0.18/0.45 # System time : 0.002 s
% 0.18/0.45 # Total time : 0.007 s
% 0.18/0.45 # Maximum resident set size: 1696 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.005 s
% 0.18/0.45 # System time : 0.004 s
% 0.18/0.45 # Total time : 0.009 s
% 0.18/0.45 # Maximum resident set size: 1680 pages
% 0.18/0.45 % E---3.1 exiting
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------