TSTP Solution File: SET811+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET811+4 : TPTP v8.1.2. Released v3.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:20:55 EDT 2023
% Result : Theorem 1.18s 0.62s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 7 unt; 0 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 130 ( 49 ~; 53 |; 17 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 82 ( 2 sgn; 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.xB6hqHhtvi/E---3.1_22908.p',subset) ).
fof(ordinal_number,axiom,
! [X1] :
( member(X1,on)
<=> ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( member(X3,X1)
=> subset(X3,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xB6hqHhtvi/E---3.1_22908.p',ordinal_number) ).
fof(thV5,conjecture,
! [X1] :
( member(X1,on)
=> ! [X3] :
( member(X3,X1)
=> equal_set(X3,initial_segment(X3,member_predicate,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.xB6hqHhtvi/E---3.1_22908.p',thV5) ).
fof(initial_segment,axiom,
! [X3,X6,X1,X5] :
( member(X5,initial_segment(X3,X6,X1))
<=> ( member(X5,X1)
& apply(X6,X5,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.xB6hqHhtvi/E---3.1_22908.p',initial_segment) ).
fof(rel_member,axiom,
! [X3,X5] :
( apply(member_predicate,X3,X5)
<=> member(X3,X5) ),
file('/export/starexec/sandbox/tmp/tmp.xB6hqHhtvi/E---3.1_22908.p',rel_member) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.xB6hqHhtvi/E---3.1_22908.p',equal_set) ).
fof(c_0_6,plain,
! [X23,X24,X25,X26,X27] :
( ( ~ subset(X23,X24)
| ~ member(X25,X23)
| member(X25,X24) )
& ( member(esk4_2(X26,X27),X26)
| subset(X26,X27) )
& ( ~ member(esk4_2(X26,X27),X27)
| subset(X26,X27) ) ),
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])])])])])]) ).
cnf(c_0_7,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,plain,
( member(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X17,X18,X19] :
( ( set(X17)
| ~ member(X17,on) )
& ( strict_well_order(member_predicate,X17)
| ~ member(X17,on) )
& ( ~ member(X18,X17)
| subset(X18,X17)
| ~ member(X17,on) )
& ( member(esk3_1(X19),X19)
| ~ set(X19)
| ~ strict_well_order(member_predicate,X19)
| member(X19,on) )
& ( ~ subset(esk3_1(X19),X19)
| ~ set(X19)
| ~ strict_well_order(member_predicate,X19)
| member(X19,on) ) ),
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)],[ordinal_number])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> ! [X3] :
( member(X3,X1)
=> equal_set(X3,initial_segment(X3,member_predicate,X1)) ) ),
inference(assume_negation,[status(cth)],[thV5]) ).
fof(c_0_11,plain,
! [X13,X14,X15,X16] :
( ( member(X16,X15)
| ~ member(X16,initial_segment(X13,X14,X15)) )
& ( apply(X14,X16,X13)
| ~ member(X16,initial_segment(X13,X14,X15)) )
& ( ~ member(X16,X15)
| ~ apply(X14,X16,X13)
| member(X16,initial_segment(X13,X14,X15)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[initial_segment])])]) ).
cnf(c_0_12,plain,
( member(esk4_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| ~ member(X1,X2)
| ~ member(X2,on) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
( member(esk1_0,on)
& member(esk2_0,esk1_0)
& ~ equal_set(esk2_0,initial_segment(esk2_0,member_predicate,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( member(X1,initial_segment(X4,X3,X2))
| ~ member(X1,X2)
| ~ apply(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X21,X22] :
( ( ~ apply(member_predicate,X21,X22)
| member(X21,X22) )
& ( ~ member(X21,X22)
| apply(member_predicate,X21,X22) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rel_member])]) ).
cnf(c_0_18,plain,
( member(esk4_2(X1,X2),X3)
| subset(X1,X2)
| ~ member(X3,on)
| ~ member(X1,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
member(esk1_0,on),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( subset(X1,initial_segment(X2,X3,X4))
| ~ apply(X3,esk4_2(X1,initial_segment(X2,X3,X4)),X2)
| ~ member(esk4_2(X1,initial_segment(X2,X3,X4)),X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( member(esk4_2(X1,X2),esk1_0)
| subset(X1,X2)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
member(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X11,X12] :
( ( subset(X11,X12)
| ~ equal_set(X11,X12) )
& ( subset(X12,X11)
| ~ equal_set(X11,X12) )
& ( ~ subset(X11,X12)
| ~ subset(X12,X11)
| equal_set(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_25,plain,
( subset(X1,initial_segment(X2,member_predicate,X3))
| ~ member(esk4_2(X1,initial_segment(X2,member_predicate,X3)),X3)
| ~ member(esk4_2(X1,initial_segment(X2,member_predicate,X3)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( member(esk4_2(esk2_0,X1),esk1_0)
| subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( apply(X1,X2,X3)
| ~ member(X2,initial_segment(X3,X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
~ equal_set(esk2_0,initial_segment(esk2_0,member_predicate,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( subset(esk2_0,initial_segment(X1,member_predicate,esk1_0))
| ~ member(esk4_2(esk2_0,initial_segment(X1,member_predicate,esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( member(X1,X2)
| ~ apply(member_predicate,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,plain,
( apply(X1,esk4_2(initial_segment(X2,X1,X3),X4),X2)
| subset(initial_segment(X2,X1,X3),X4) ),
inference(spm,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( ~ subset(initial_segment(esk2_0,member_predicate,esk1_0),esk2_0)
| ~ subset(esk2_0,initial_segment(esk2_0,member_predicate,esk1_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
subset(esk2_0,initial_segment(esk2_0,member_predicate,esk1_0)),
inference(spm,[status(thm)],[c_0_30,c_0_8]) ).
cnf(c_0_35,plain,
( member(esk4_2(initial_segment(X1,member_predicate,X2),X3),X1)
| subset(initial_segment(X1,member_predicate,X2),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ subset(initial_segment(esk2_0,member_predicate,esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,plain,
subset(initial_segment(X1,member_predicate,X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET811+4 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n009.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 17:03:59 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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.xB6hqHhtvi/E---3.1_22908.p
% 1.18/0.62 # Version: 3.1pre001
% 1.18/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.62 # Starting sh5l with 300s (1) cores
% 1.18/0.62 # new_bool_1 with pid 23044 completed with status 0
% 1.18/0.62 # Result found by new_bool_1
% 1.18/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.18/0.62 # Search class: FGHSF-FFMF32-SFFFFFNN
% 1.18/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.18/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23050 completed with status 0
% 1.18/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.18/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.18/0.62 # Search class: FGHSF-FFMF32-SFFFFFNN
% 1.18/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.18/0.62 # Preprocessing time : 0.002 s
% 1.18/0.62 # Presaturation interreduction done
% 1.18/0.62
% 1.18/0.62 # Proof found!
% 1.18/0.62 # SZS status Theorem
% 1.18/0.62 # SZS output start CNFRefutation
% See solution above
% 1.18/0.62 # Parsed axioms : 20
% 1.18/0.62 # Removed by relevancy pruning/SinE : 10
% 1.18/0.62 # Initial clauses : 56
% 1.18/0.62 # Removed in clause preprocessing : 0
% 1.18/0.62 # Initial clauses in saturation : 56
% 1.18/0.62 # Processed clauses : 1294
% 1.18/0.62 # ...of these trivial : 1
% 1.18/0.62 # ...subsumed : 366
% 1.18/0.62 # ...remaining for further processing : 927
% 1.18/0.62 # Other redundant clauses eliminated : 0
% 1.18/0.62 # Clauses deleted for lack of memory : 0
% 1.18/0.62 # Backward-subsumed : 47
% 1.18/0.62 # Backward-rewritten : 7
% 1.18/0.62 # Generated clauses : 4284
% 1.18/0.62 # ...of the previous two non-redundant : 4080
% 1.18/0.62 # ...aggressively subsumed : 0
% 1.18/0.62 # Contextual simplify-reflections : 51
% 1.18/0.62 # Paramodulations : 4284
% 1.18/0.62 # Factorizations : 0
% 1.18/0.62 # NegExts : 0
% 1.18/0.62 # Equation resolutions : 0
% 1.18/0.62 # Total rewrite steps : 263
% 1.18/0.62 # Propositional unsat checks : 0
% 1.18/0.62 # Propositional check models : 0
% 1.18/0.62 # Propositional check unsatisfiable : 0
% 1.18/0.62 # Propositional clauses : 0
% 1.18/0.62 # Propositional clauses after purity: 0
% 1.18/0.62 # Propositional unsat core size : 0
% 1.18/0.62 # Propositional preprocessing time : 0.000
% 1.18/0.62 # Propositional encoding time : 0.000
% 1.18/0.62 # Propositional solver time : 0.000
% 1.18/0.62 # Success case prop preproc time : 0.000
% 1.18/0.62 # Success case prop encoding time : 0.000
% 1.18/0.62 # Success case prop solver time : 0.000
% 1.18/0.62 # Current number of processed clauses : 817
% 1.18/0.62 # Positive orientable unit clauses : 81
% 1.18/0.62 # Positive unorientable unit clauses: 0
% 1.18/0.62 # Negative unit clauses : 3
% 1.18/0.62 # Non-unit-clauses : 733
% 1.18/0.62 # Current number of unprocessed clauses: 2873
% 1.18/0.62 # ...number of literals in the above : 13108
% 1.18/0.62 # Current number of archived formulas : 0
% 1.18/0.62 # Current number of archived clauses : 110
% 1.18/0.62 # Clause-clause subsumption calls (NU) : 58401
% 1.18/0.62 # Rec. Clause-clause subsumption calls : 22945
% 1.18/0.62 # Non-unit clause-clause subsumptions : 456
% 1.18/0.62 # Unit Clause-clause subsumption calls : 1119
% 1.18/0.62 # Rewrite failures with RHS unbound : 0
% 1.18/0.62 # BW rewrite match attempts : 472
% 1.18/0.62 # BW rewrite match successes : 8
% 1.18/0.62 # Condensation attempts : 0
% 1.18/0.62 # Condensation successes : 0
% 1.18/0.62 # Termbank termtop insertions : 105093
% 1.18/0.62
% 1.18/0.62 # -------------------------------------------------
% 1.18/0.62 # User time : 0.136 s
% 1.18/0.62 # System time : 0.009 s
% 1.18/0.62 # Total time : 0.145 s
% 1.18/0.62 # Maximum resident set size: 1888 pages
% 1.18/0.62
% 1.18/0.62 # -------------------------------------------------
% 1.18/0.62 # User time : 0.140 s
% 1.18/0.62 # System time : 0.009 s
% 1.18/0.62 # Total time : 0.148 s
% 1.18/0.62 # Maximum resident set size: 1700 pages
% 1.18/0.62 % E---3.1 exiting
% 1.18/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------