TSTP Solution File: SEU317+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU317+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:31:36 EDT 2023
% Result : Theorem 0.17s 0.57s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 133 ( 53 ~; 57 |; 10 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 54 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.r1ZnZXwWyD/E---3.1_3364.p',d3_tarski) ).
fof(t45_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( in(X3,the_carrier(X1))
=> ( in(X3,topstr_closure(X1,X2))
<=> ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( ( closed_subset(X4,X1)
& subset(X2,X4) )
=> in(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.r1ZnZXwWyD/E---3.1_3364.p',t45_pre_topc) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.r1ZnZXwWyD/E---3.1_3364.p',t3_subset) ).
fof(t48_pre_topc,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.r1ZnZXwWyD/E---3.1_3364.p',t48_pre_topc) ).
fof(c_0_4,plain,
! [X32,X33,X34,X35,X36] :
( ( ~ subset(X32,X33)
| ~ in(X34,X32)
| in(X34,X33) )
& ( in(esk1_2(X35,X36),X35)
| subset(X35,X36) )
& ( ~ in(esk1_2(X35,X36),X36)
| subset(X35,X36) ) ),
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)],[d3_tarski])])])])])]) ).
fof(c_0_5,plain,
! [X58,X59,X60,X61] :
( ( ~ in(X60,topstr_closure(X58,X59))
| ~ element(X61,powerset(the_carrier(X58)))
| ~ closed_subset(X61,X58)
| ~ subset(X59,X61)
| in(X60,X61)
| ~ in(X60,the_carrier(X58))
| ~ element(X59,powerset(the_carrier(X58)))
| ~ top_str(X58) )
& ( element(esk8_3(X58,X59,X60),powerset(the_carrier(X58)))
| in(X60,topstr_closure(X58,X59))
| ~ in(X60,the_carrier(X58))
| ~ element(X59,powerset(the_carrier(X58)))
| ~ top_str(X58) )
& ( closed_subset(esk8_3(X58,X59,X60),X58)
| in(X60,topstr_closure(X58,X59))
| ~ in(X60,the_carrier(X58))
| ~ element(X59,powerset(the_carrier(X58)))
| ~ top_str(X58) )
& ( subset(X59,esk8_3(X58,X59,X60))
| in(X60,topstr_closure(X58,X59))
| ~ in(X60,the_carrier(X58))
| ~ element(X59,powerset(the_carrier(X58)))
| ~ top_str(X58) )
& ( ~ in(X60,esk8_3(X58,X59,X60))
| in(X60,topstr_closure(X58,X59))
| ~ in(X60,the_carrier(X58))
| ~ element(X59,powerset(the_carrier(X58)))
| ~ top_str(X58) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t45_pre_topc])])])])]) ).
fof(c_0_6,plain,
! [X56,X57] :
( ( ~ element(X56,powerset(X57))
| subset(X56,X57) )
& ( ~ subset(X56,X57)
| element(X56,powerset(X57)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
cnf(c_0_7,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( subset(X1,esk8_3(X2,X1,X3))
| in(X3,topstr_closure(X2,X1))
| ~ in(X3,the_carrier(X2))
| ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,topstr_closure(X2,X3))
| ~ in(X1,esk8_3(X2,X3,X1))
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( in(X1,esk8_3(X2,X3,X4))
| in(X4,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X4,the_carrier(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[t48_pre_topc]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
fof(c_0_16,negated_conjecture,
( top_str(esk9_0)
& element(esk10_0,powerset(the_carrier(esk9_0)))
& ~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_17,plain,
( subset(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(esk1_2(X1,topstr_closure(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( subset(X1,topstr_closure(X2,X1))
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
top_str(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
element(esk10_0,powerset(the_carrier(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SEU317+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:06:54 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.r1ZnZXwWyD/E---3.1_3364.p
% 0.17/0.57 # Version: 3.1pre001
% 0.17/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.57 # Starting sh5l with 300s (1) cores
% 0.17/0.57 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3441 completed with status 0
% 0.17/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.57 # No SInE strategy applied
% 0.17/0.57 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/0.57 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.57 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.17/0.57 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.57 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.17/0.57 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 3450 completed with status 0
% 0.17/0.57 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.17/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.57 # No SInE strategy applied
% 0.17/0.57 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/0.57 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.57 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.17/0.57 # Preprocessing time : 0.002 s
% 0.17/0.57
% 0.17/0.57 # Proof found!
% 0.17/0.57 # SZS status Theorem
% 0.17/0.57 # SZS output start CNFRefutation
% See solution above
% 0.17/0.57 # Parsed axioms : 43
% 0.17/0.57 # Removed by relevancy pruning/SinE : 0
% 0.17/0.57 # Initial clauses : 88
% 0.17/0.57 # Removed in clause preprocessing : 5
% 0.17/0.57 # Initial clauses in saturation : 83
% 0.17/0.57 # Processed clauses : 1442
% 0.17/0.57 # ...of these trivial : 0
% 0.17/0.57 # ...subsumed : 750
% 0.17/0.57 # ...remaining for further processing : 692
% 0.17/0.57 # Other redundant clauses eliminated : 0
% 0.17/0.57 # Clauses deleted for lack of memory : 0
% 0.17/0.57 # Backward-subsumed : 44
% 0.17/0.57 # Backward-rewritten : 5
% 0.17/0.57 # Generated clauses : 2991
% 0.17/0.57 # ...of the previous two non-redundant : 2743
% 0.17/0.57 # ...aggressively subsumed : 0
% 0.17/0.57 # Contextual simplify-reflections : 2
% 0.17/0.57 # Paramodulations : 2991
% 0.17/0.57 # Factorizations : 0
% 0.17/0.57 # NegExts : 0
% 0.17/0.57 # Equation resolutions : 0
% 0.17/0.57 # Total rewrite steps : 342
% 0.17/0.57 # Propositional unsat checks : 0
% 0.17/0.57 # Propositional check models : 0
% 0.17/0.57 # Propositional check unsatisfiable : 0
% 0.17/0.57 # Propositional clauses : 0
% 0.17/0.57 # Propositional clauses after purity: 0
% 0.17/0.57 # Propositional unsat core size : 0
% 0.17/0.57 # Propositional preprocessing time : 0.000
% 0.17/0.57 # Propositional encoding time : 0.000
% 0.17/0.57 # Propositional solver time : 0.000
% 0.17/0.57 # Success case prop preproc time : 0.000
% 0.17/0.57 # Success case prop encoding time : 0.000
% 0.17/0.57 # Success case prop solver time : 0.000
% 0.17/0.57 # Current number of processed clauses : 643
% 0.17/0.57 # Positive orientable unit clauses : 31
% 0.17/0.57 # Positive unorientable unit clauses: 0
% 0.17/0.57 # Negative unit clauses : 9
% 0.17/0.57 # Non-unit-clauses : 603
% 0.17/0.57 # Current number of unprocessed clauses: 1199
% 0.17/0.57 # ...number of literals in the above : 5822
% 0.17/0.57 # Current number of archived formulas : 0
% 0.17/0.57 # Current number of archived clauses : 49
% 0.17/0.57 # Clause-clause subsumption calls (NU) : 89714
% 0.17/0.57 # Rec. Clause-clause subsumption calls : 30156
% 0.17/0.57 # Non-unit clause-clause subsumptions : 659
% 0.17/0.57 # Unit Clause-clause subsumption calls : 600
% 0.17/0.57 # Rewrite failures with RHS unbound : 0
% 0.17/0.57 # BW rewrite match attempts : 21
% 0.17/0.57 # BW rewrite match successes : 4
% 0.17/0.57 # Condensation attempts : 0
% 0.17/0.57 # Condensation successes : 0
% 0.17/0.57 # Termbank termtop insertions : 54220
% 0.17/0.57
% 0.17/0.57 # -------------------------------------------------
% 0.17/0.57 # User time : 0.121 s
% 0.17/0.57 # System time : 0.004 s
% 0.17/0.57 # Total time : 0.125 s
% 0.17/0.57 # Maximum resident set size: 1888 pages
% 0.17/0.57
% 0.17/0.57 # -------------------------------------------------
% 0.17/0.57 # User time : 0.585 s
% 0.17/0.57 # System time : 0.027 s
% 0.17/0.57 # Total time : 0.612 s
% 0.17/0.57 # Maximum resident set size: 1728 pages
% 0.17/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------