TSTP Solution File: SET148+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET148+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:18:40 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 62 ( 26 ~; 24 |; 8 &)
% ( 3 <=>; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 43 ( 2 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI13,conjecture,
! [X1] : equal_set(intersection(X1,X1),X1),
file('/export/starexec/sandbox2/tmp/tmp.kw5SOtviA0/E---3.1_5752.p',thI13) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kw5SOtviA0/E---3.1_5752.p',intersection) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kw5SOtviA0/E---3.1_5752.p',subset) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kw5SOtviA0/E---3.1_5752.p',equal_set) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : equal_set(intersection(X1,X1),X1),
inference(assume_negation,[status(cth)],[thI13]) ).
fof(c_0_5,plain,
! [X9,X10,X11] :
( ( member(X9,X10)
| ~ member(X9,intersection(X10,X11)) )
& ( member(X9,X11)
| ~ member(X9,intersection(X10,X11)) )
& ( ~ member(X9,X10)
| ~ member(X9,X11)
| member(X9,intersection(X10,X11)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])]) ).
fof(c_0_6,plain,
! [X12,X13,X14,X15,X16] :
( ( ~ subset(X12,X13)
| ~ member(X14,X12)
| member(X14,X13) )
& ( member(esk2_2(X15,X16),X15)
| subset(X15,X16) )
& ( ~ member(esk2_2(X15,X16),X16)
| subset(X15,X16) ) ),
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_7,negated_conjecture,
~ equal_set(intersection(esk1_0,esk1_0),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X7,X8] :
( ( subset(X7,X8)
| ~ equal_set(X7,X8) )
& ( subset(X8,X7)
| ~ equal_set(X7,X8) )
& ( ~ subset(X7,X8)
| ~ subset(X8,X7)
| equal_set(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( member(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ equal_set(intersection(esk1_0,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( member(esk2_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk2_2(X1,intersection(X2,X3)),X3)
| ~ member(esk2_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(esk1_0,intersection(esk1_0,esk1_0))
| ~ subset(intersection(esk1_0,esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
subset(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_19,plain,
( subset(X1,intersection(X2,X1))
| ~ member(esk2_2(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_20,negated_conjecture,
~ subset(esk1_0,intersection(esk1_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,plain,
subset(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SET148+4 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 17:05:06 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.45 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.kw5SOtviA0/E---3.1_5752.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 5895 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 5899 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 12
% 0.17/0.46 # Removed by relevancy pruning/SinE : 8
% 0.17/0.46 # Initial clauses : 10
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 10
% 0.17/0.46 # Processed clauses : 32
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 2
% 0.17/0.46 # ...remaining for further processing : 30
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 2
% 0.17/0.46 # Generated clauses : 27
% 0.17/0.46 # ...of the previous two non-redundant : 22
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 27
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 2
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 18
% 0.17/0.46 # Positive orientable unit clauses : 4
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 13
% 0.17/0.46 # Current number of unprocessed clauses: 10
% 0.17/0.46 # ...number of literals in the above : 21
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 12
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 37
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 37
% 0.17/0.46 # Non-unit clause-clause subsumptions : 2
% 0.17/0.46 # Unit Clause-clause subsumption calls : 12
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 12
% 0.17/0.46 # BW rewrite match successes : 2
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 985
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.006 s
% 0.17/0.46 # System time : 0.000 s
% 0.17/0.46 # Total time : 0.006 s
% 0.17/0.46 # Maximum resident set size: 1756 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.008 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.010 s
% 0.17/0.46 # Maximum resident set size: 1684 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------