TSTP Solution File: SET692+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET692+4 : 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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:19:57 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 4 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 92 ( 37 ~; 40 |; 9 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 4 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cOyQ2QeKa3/E---3.1_11502.p',subset) ).
fof(thI19,conjecture,
! [X1,X2] :
( equal_set(X1,intersection(X1,X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.cOyQ2QeKa3/E---3.1_11502.p',thI19) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cOyQ2QeKa3/E---3.1_11502.p',intersection) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cOyQ2QeKa3/E---3.1_11502.p',equal_set) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ subset(X8,X9)
| ~ member(X10,X8)
| member(X10,X9) )
& ( member(esk3_2(X11,X12),X11)
| subset(X11,X12) )
& ( ~ member(esk3_2(X11,X12),X12)
| subset(X11,X12) ) ),
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])])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( equal_set(X1,intersection(X1,X2))
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[thI19]) ).
fof(c_0_6,plain,
! [X18,X19,X20] :
( ( member(X18,X19)
| ~ member(X18,intersection(X19,X20)) )
& ( member(X18,X20)
| ~ member(X18,intersection(X19,X20)) )
& ( ~ member(X18,X19)
| ~ member(X18,X20)
| member(X18,intersection(X19,X20)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
cnf(c_0_7,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X14,X15] :
( ( subset(X14,X15)
| ~ equal_set(X14,X15) )
& ( subset(X15,X14)
| ~ equal_set(X14,X15) )
& ( ~ subset(X14,X15)
| ~ subset(X15,X14)
| equal_set(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
fof(c_0_10,negated_conjecture,
( ( ~ equal_set(esk1_0,intersection(esk1_0,esk2_0))
| ~ subset(esk1_0,esk2_0) )
& ( equal_set(esk1_0,intersection(esk1_0,esk2_0))
| subset(esk1_0,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( member(esk3_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( equal_set(esk1_0,intersection(esk1_0,esk2_0))
| subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ equal_set(esk1_0,intersection(esk1_0,esk2_0))
| ~ subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,plain,
( member(esk3_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_20,plain,
( member(esk3_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,intersection(X4,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( subset(esk1_0,intersection(esk1_0,esk2_0))
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( ~ subset(intersection(esk1_0,esk2_0),esk1_0)
| ~ subset(esk1_0,intersection(esk1_0,esk2_0))
| ~ subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
subset(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( member(esk3_2(esk1_0,X1),esk2_0)
| subset(esk1_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_13]) ).
cnf(c_0_26,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk3_2(X1,intersection(X2,X3)),X3)
| ~ member(esk3_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ subset(esk1_0,intersection(esk1_0,esk2_0))
| ~ subset(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( subset(esk1_0,intersection(X1,esk2_0))
| ~ member(esk3_2(esk1_0,intersection(X1,esk2_0)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ subset(esk1_0,intersection(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_8]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET692+4 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n009.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 10:08:40 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.cOyQ2QeKa3/E---3.1_11502.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # sh5l with pid 11583 completed with status 0
% 0.15/0.43 # Result found by sh5l
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 # Search class: FGHNF-FFSF21-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 181s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 11586 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 # Search class: FGHNF-FFSF21-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 12
% 0.15/0.43 # Removed by relevancy pruning/SinE : 7
% 0.15/0.43 # Initial clauses : 13
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 13
% 0.15/0.43 # Processed clauses : 62
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 8
% 0.15/0.43 # ...remaining for further processing : 54
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 6
% 0.15/0.43 # Generated clauses : 88
% 0.15/0.43 # ...of the previous two non-redundant : 73
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 1
% 0.15/0.43 # Paramodulations : 88
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 9
% 0.15/0.43 # ...of those cached : 6
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 35
% 0.15/0.43 # Positive orientable unit clauses : 4
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 2
% 0.15/0.43 # Non-unit-clauses : 29
% 0.15/0.43 # Current number of unprocessed clauses: 34
% 0.15/0.43 # ...number of literals in the above : 99
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 19
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 134
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 119
% 0.15/0.43 # Non-unit clause-clause subsumptions : 8
% 0.15/0.43 # Unit Clause-clause subsumption calls : 13
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 13
% 0.15/0.43 # BW rewrite match successes : 2
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 2092
% 0.15/0.43 # Search garbage collected termcells : 269
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.006 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.007 s
% 0.15/0.43 # Maximum resident set size: 1740 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.006 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.010 s
% 0.15/0.43 # Maximum resident set size: 1704 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------