TSTP Solution File: SET015+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET015+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:17:55 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 23 ~; 27 |; 7 &)
% ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 2 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.swXI4uFlmC/E---3.1_24722.p',subset) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.swXI4uFlmC/E---3.1_24722.p',union) ).
fof(thI07,conjecture,
! [X1,X2] : equal_set(union(X1,X2),union(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.swXI4uFlmC/E---3.1_24722.p',thI07) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.swXI4uFlmC/E---3.1_24722.p',equal_set) ).
fof(c_0_4,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ member(X15,X13)
| member(X15,X14) )
& ( member(esk3_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ member(esk3_2(X16,X17),X17)
| subset(X16,X17) ) ),
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_5,plain,
! [X10,X11,X12] :
( ( ~ member(X10,union(X11,X12))
| member(X10,X11)
| member(X10,X12) )
& ( ~ member(X10,X11)
| member(X10,union(X11,X12)) )
& ( ~ member(X10,X12)
| member(X10,union(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] : equal_set(union(X1,X2),union(X2,X1)),
inference(assume_negation,[status(cth)],[thI07]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,negated_conjecture,
~ equal_set(union(esk1_0,esk2_0),union(esk2_0,esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_12,plain,
! [X8,X9] :
( ( subset(X8,X9)
| ~ equal_set(X8,X9) )
& ( subset(X9,X8)
| ~ equal_set(X8,X9) )
& ( ~ subset(X8,X9)
| ~ subset(X9,X8)
| equal_set(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_13,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
( member(esk3_2(union(X1,X2),X3),X1)
| member(esk3_2(union(X1,X2),X3),X2)
| subset(union(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ equal_set(union(esk1_0,esk2_0),union(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_19,plain,
( member(esk3_2(union(X1,X2),union(X2,X3)),X1)
| subset(union(X1,X2),union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ subset(union(esk2_0,esk1_0),union(esk1_0,esk2_0))
| ~ subset(union(esk1_0,esk2_0),union(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
subset(union(X1,X2),union(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET015+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n008.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 : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 16:57:58 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.swXI4uFlmC/E---3.1_24722.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 24801 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 24804 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 12
% 0.15/0.42 # Removed by relevancy pruning/SinE : 8
% 0.15/0.42 # Initial clauses : 10
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 10
% 0.15/0.42 # Processed clauses : 95
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 35
% 0.15/0.42 # ...remaining for further processing : 60
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 1
% 0.15/0.42 # Generated clauses : 267
% 0.15/0.42 # ...of the previous two non-redundant : 256
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 259
% 0.15/0.42 # Factorizations : 8
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 4
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 49
% 0.15/0.42 # Positive orientable unit clauses : 16
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 1
% 0.15/0.42 # Non-unit-clauses : 32
% 0.15/0.42 # Current number of unprocessed clauses: 181
% 0.15/0.42 # ...number of literals in the above : 457
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 11
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 347
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 267
% 0.15/0.42 # Non-unit clause-clause subsumptions : 35
% 0.15/0.42 # Unit Clause-clause subsumption calls : 50
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 39
% 0.15/0.42 # BW rewrite match successes : 2
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 4604
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.008 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.009 s
% 0.15/0.42 # Maximum resident set size: 1720 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.009 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.012 s
% 0.15/0.42 # Maximum resident set size: 1684 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------