TSTP Solution File: SET696+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET696+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:20:17 EDT 2023
% Result : Theorem 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 33 ~; 24 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 4 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI28,conjecture,
! [X1,X4] :
( subset(X1,X4)
=> equal_set(intersection(difference(X4,X1),X1),empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.Xj27u9lP7T/E---3.1_26748.p',thI28) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xj27u9lP7T/E---3.1_26748.p',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xj27u9lP7T/E---3.1_26748.p',subset) ).
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox2/tmp/tmp.Xj27u9lP7T/E---3.1_26748.p',empty_set) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xj27u9lP7T/E---3.1_26748.p',difference) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Xj27u9lP7T/E---3.1_26748.p',intersection) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X4] :
( subset(X1,X4)
=> equal_set(intersection(difference(X4,X1),X1),empty_set) ),
inference(assume_negation,[status(cth)],[thI28]) ).
fof(c_0_7,negated_conjecture,
( subset(esk4_0,esk5_0)
& ~ equal_set(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ( subset(X12,X13)
| ~ equal_set(X12,X13) )
& ( subset(X13,X12)
| ~ equal_set(X12,X13) )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| equal_set(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_set(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk1_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk1_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])])])])])]) ).
fof(c_0_12,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[empty_set]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(empty_set,intersection(difference(esk5_0,esk4_0),esk4_0))
| ~ subset(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X22] : ~ member(X22,empty_set),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[difference]) ).
fof(c_0_17,plain,
! [X16,X17,X18] :
( ( member(X16,X17)
| ~ member(X16,intersection(X17,X18)) )
& ( member(X16,X18)
| ~ member(X16,intersection(X17,X18)) )
& ( ~ member(X16,X17)
| ~ member(X16,X18)
| member(X16,intersection(X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])]) ).
cnf(c_0_18,negated_conjecture,
( member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),intersection(difference(esk5_0,esk4_0),esk4_0))
| ~ subset(empty_set,intersection(difference(esk5_0,esk4_0),esk4_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X23,X24,X25] :
( ( member(X23,X25)
| ~ member(X23,difference(X25,X24)) )
& ( ~ member(X23,X24)
| ~ member(X23,difference(X25,X24)) )
& ( ~ member(X23,X25)
| member(X23,X24)
| member(X23,difference(X25,X24)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),intersection(difference(esk5_0,esk4_0),esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).
cnf(c_0_23,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),difference(esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),esk4_0),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SET696+4 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n024.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 16:32:12 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.16/0.40 Running first-order theorem proving
% 0.16/0.40 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.Xj27u9lP7T/E---3.1_26748.p
% 0.16/0.42 # Version: 3.1pre001
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26884 completed with status 0
% 0.16/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.16/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.42 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.42 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S05BI with 136s (1) cores
% 0.16/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S05BI with pid 26899 completed with status 0
% 0.16/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S05BI
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.16/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.42 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.42 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S05BI with 136s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Theorem
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 12
% 0.16/0.42 # Removed by relevancy pruning/SinE : 0
% 0.16/0.42 # Initial clauses : 31
% 0.16/0.42 # Removed in clause preprocessing : 0
% 0.16/0.42 # Initial clauses in saturation : 31
% 0.16/0.42 # Processed clauses : 62
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 62
% 0.16/0.42 # Other redundant clauses eliminated : 3
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 1
% 0.16/0.42 # Backward-rewritten : 1
% 0.16/0.42 # Generated clauses : 25
% 0.16/0.42 # ...of the previous two non-redundant : 20
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 22
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 3
% 0.16/0.42 # Total rewrite steps : 2
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 26
% 0.16/0.42 # Positive orientable unit clauses : 8
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 3
% 0.16/0.42 # Non-unit-clauses : 15
% 0.16/0.42 # Current number of unprocessed clauses: 19
% 0.16/0.42 # ...number of literals in the above : 47
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 33
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 113
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 105
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 23
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 4
% 0.16/0.42 # BW rewrite match successes : 1
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 1961
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.004 s
% 0.16/0.42 # System time : 0.002 s
% 0.16/0.42 # Total time : 0.006 s
% 0.16/0.42 # Maximum resident set size: 1768 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.016 s
% 0.16/0.42 # System time : 0.003 s
% 0.16/0.42 # Total time : 0.020 s
% 0.16/0.42 # Maximum resident set size: 1688 pages
% 0.16/0.42 % E---3.1 exiting
% 0.16/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------