TSTP Solution File: SET807+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET807+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 46 ( 3 avg)
% Number of connectives : 131 ( 36 ~; 68 |; 20 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 1 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5mEieVezob/E---3.1_19019.p',subset) ).
fof(rel_subset,hypothesis,
! [X3,X5] :
( apply(subset_predicate,X3,X5)
<=> subset(X3,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.5mEieVezob/E---3.1_19019.p',rel_subset) ).
fof(pre_order,axiom,
! [X7,X4] :
( pre_order(X7,X4)
<=> ( ! [X3] :
( member(X3,X4)
=> apply(X7,X3,X3) )
& ! [X3,X5,X6] :
( ( member(X3,X4)
& member(X5,X4)
& member(X6,X4) )
=> ( ( apply(X7,X3,X5)
& apply(X7,X5,X6) )
=> apply(X7,X3,X6) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5mEieVezob/E---3.1_19019.p',pre_order) ).
fof(thIV18a,conjecture,
! [X4] : pre_order(subset_predicate,power_set(X4)),
file('/export/starexec/sandbox2/tmp/tmp.5mEieVezob/E---3.1_19019.p',thIV18a) ).
fof(c_0_4,plain,
! [X11,X12,X13,X14,X15] :
( ( ~ subset(X11,X12)
| ~ member(X13,X11)
| member(X13,X12) )
& ( member(esk2_2(X14,X15),X14)
| subset(X14,X15) )
& ( ~ member(esk2_2(X14,X15),X15)
| subset(X14,X15) ) ),
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,hypothesis,
! [X8,X9] :
( ( ~ apply(subset_predicate,X8,X9)
| subset(X8,X9) )
& ( ~ subset(X8,X9)
| apply(subset_predicate,X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rel_subset])]) ).
cnf(c_0_6,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( member(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ member(X19,X18)
| apply(X17,X19,X19)
| ~ pre_order(X17,X18) )
& ( ~ member(X20,X18)
| ~ member(X21,X18)
| ~ member(X22,X18)
| ~ apply(X17,X20,X21)
| ~ apply(X17,X21,X22)
| apply(X17,X20,X22)
| ~ pre_order(X17,X18) )
& ( member(esk4_2(X23,X24),X24)
| member(esk3_2(X23,X24),X24)
| pre_order(X23,X24) )
& ( member(esk5_2(X23,X24),X24)
| member(esk3_2(X23,X24),X24)
| pre_order(X23,X24) )
& ( member(esk6_2(X23,X24),X24)
| member(esk3_2(X23,X24),X24)
| pre_order(X23,X24) )
& ( apply(X23,esk4_2(X23,X24),esk5_2(X23,X24))
| member(esk3_2(X23,X24),X24)
| pre_order(X23,X24) )
& ( apply(X23,esk5_2(X23,X24),esk6_2(X23,X24))
| member(esk3_2(X23,X24),X24)
| pre_order(X23,X24) )
& ( ~ apply(X23,esk4_2(X23,X24),esk6_2(X23,X24))
| member(esk3_2(X23,X24),X24)
| pre_order(X23,X24) )
& ( member(esk4_2(X23,X24),X24)
| ~ apply(X23,esk3_2(X23,X24),esk3_2(X23,X24))
| pre_order(X23,X24) )
& ( member(esk5_2(X23,X24),X24)
| ~ apply(X23,esk3_2(X23,X24),esk3_2(X23,X24))
| pre_order(X23,X24) )
& ( member(esk6_2(X23,X24),X24)
| ~ apply(X23,esk3_2(X23,X24),esk3_2(X23,X24))
| pre_order(X23,X24) )
& ( apply(X23,esk4_2(X23,X24),esk5_2(X23,X24))
| ~ apply(X23,esk3_2(X23,X24),esk3_2(X23,X24))
| pre_order(X23,X24) )
& ( apply(X23,esk5_2(X23,X24),esk6_2(X23,X24))
| ~ apply(X23,esk3_2(X23,X24),esk3_2(X23,X24))
| pre_order(X23,X24) )
& ( ~ apply(X23,esk4_2(X23,X24),esk6_2(X23,X24))
| ~ apply(X23,esk3_2(X23,X24),esk3_2(X23,X24))
| pre_order(X23,X24) ) ),
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)],[pre_order])])])])])]) ).
cnf(c_0_10,hypothesis,
( apply(subset_predicate,X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
subset(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
( member(esk2_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,hypothesis,
( subset(X1,X2)
| ~ apply(subset_predicate,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( apply(X1,esk4_2(X1,X2),esk5_2(X1,X2))
| pre_order(X1,X2)
| ~ apply(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
apply(subset_predicate,X1,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( apply(X1,esk5_2(X1,X2),esk6_2(X1,X2))
| pre_order(X1,X2)
| ~ apply(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,hypothesis,
( member(esk2_2(X1,X2),X3)
| subset(X1,X2)
| ~ apply(subset_predicate,X1,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
( pre_order(subset_predicate,X1)
| apply(subset_predicate,esk4_2(subset_predicate,X1),esk5_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
( pre_order(subset_predicate,X1)
| apply(subset_predicate,esk5_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,hypothesis,
( pre_order(subset_predicate,X1)
| member(esk2_2(esk4_2(subset_predicate,X1),X2),esk5_2(subset_predicate,X1))
| subset(esk4_2(subset_predicate,X1),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
( pre_order(subset_predicate,X1)
| member(esk2_2(esk5_2(subset_predicate,X1),X2),esk6_2(subset_predicate,X1))
| subset(esk5_2(subset_predicate,X1),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_22,hypothesis,
( pre_order(subset_predicate,X1)
| member(esk2_2(esk4_2(subset_predicate,X1),X2),X3)
| subset(esk4_2(subset_predicate,X1),X2)
| ~ subset(esk5_2(subset_predicate,X1),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_23,hypothesis,
( pre_order(subset_predicate,X1)
| subset(esk5_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_24,hypothesis,
( pre_order(subset_predicate,X1)
| member(esk2_2(esk4_2(subset_predicate,X1),X2),esk6_2(subset_predicate,X1))
| subset(esk4_2(subset_predicate,X1),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,negated_conjecture,
~ ! [X4] : pre_order(subset_predicate,power_set(X4)),
inference(assume_negation,[status(cth)],[thIV18a]) ).
cnf(c_0_26,hypothesis,
( pre_order(subset_predicate,X1)
| subset(esk4_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
fof(c_0_27,negated_conjecture,
~ pre_order(subset_predicate,power_set(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
cnf(c_0_28,plain,
( pre_order(X1,X2)
| ~ apply(X1,esk4_2(X1,X2),esk6_2(X1,X2))
| ~ apply(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,hypothesis,
( pre_order(subset_predicate,X1)
| apply(subset_predicate,esk4_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ pre_order(subset_predicate,power_set(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
pre_order(subset_predicate,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET807+4 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 17:52:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.5mEieVezob/E---3.1_19019.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_1 with pid 19134 completed with status 0
% 0.21/0.53 # Result found by new_bool_1
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGUNF-FFMF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 181s (1) cores
% 0.21/0.53 # G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with pid 19146 completed with status 0
% 0.21/0.53 # Result found by G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGUNF-FFMF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 18
% 0.21/0.53 # Removed by relevancy pruning/SinE : 13
% 0.21/0.53 # Initial clauses : 22
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 22
% 0.21/0.53 # Processed clauses : 179
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 55
% 0.21/0.53 # ...remaining for further processing : 124
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 73
% 0.21/0.53 # Generated clauses : 600
% 0.21/0.53 # ...of the previous two non-redundant : 594
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 600
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 42
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 51
% 0.21/0.53 # Positive orientable unit clauses : 3
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 0
% 0.21/0.53 # Non-unit-clauses : 48
% 0.21/0.53 # Current number of unprocessed clauses: 437
% 0.21/0.53 # ...number of literals in the above : 2306
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 73
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 2579
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 1462
% 0.21/0.53 # Non-unit clause-clause subsumptions : 55
% 0.21/0.53 # Unit Clause-clause subsumption calls : 51
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 18
% 0.21/0.53 # BW rewrite match successes : 15
% 0.21/0.53 # Condensation attempts : 179
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 20127
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.025 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.027 s
% 0.21/0.53 # Maximum resident set size: 1720 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.025 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.030 s
% 0.21/0.53 # Maximum resident set size: 1704 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------