TSTP Solution File: SEU251+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU251+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:25:30 EDT 2023
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 108 ( 19 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 134 ( 56 ~; 56 |; 12 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 64 ( 2 sgn; 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_wellord1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.ATWVV1rtw1/E---3.1_26288.p',t21_wellord1) ).
fof(d1_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( X3 = fiber(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 != X2
& in(ordered_pair(X4,X2),X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ATWVV1rtw1/E---3.1_26288.p',d1_wellord1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.ATWVV1rtw1/E---3.1_26288.p',d3_tarski) ).
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ATWVV1rtw1/E---3.1_26288.p',t16_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.ATWVV1rtw1/E---3.1_26288.p',dt_k2_wellord1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
inference(assume_negation,[status(cth)],[t21_wellord1]) ).
fof(c_0_6,plain,
! [X17,X18,X19,X20,X21,X22,X23] :
( ( X20 != X18
| ~ in(X20,X19)
| X19 != fiber(X17,X18)
| ~ relation(X17) )
& ( in(ordered_pair(X20,X18),X17)
| ~ in(X20,X19)
| X19 != fiber(X17,X18)
| ~ relation(X17) )
& ( X21 = X18
| ~ in(ordered_pair(X21,X18),X17)
| in(X21,X19)
| X19 != fiber(X17,X18)
| ~ relation(X17) )
& ( ~ in(esk5_3(X17,X22,X23),X23)
| esk5_3(X17,X22,X23) = X22
| ~ in(ordered_pair(esk5_3(X17,X22,X23),X22),X17)
| X23 = fiber(X17,X22)
| ~ relation(X17) )
& ( esk5_3(X17,X22,X23) != X22
| in(esk5_3(X17,X22,X23),X23)
| X23 = fiber(X17,X22)
| ~ relation(X17) )
& ( in(ordered_pair(esk5_3(X17,X22,X23),X22),X17)
| in(esk5_3(X17,X22,X23),X23)
| X23 = fiber(X17,X22)
| ~ relation(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)],[d1_wellord1])])])])])]) ).
fof(c_0_7,negated_conjecture,
( relation(esk3_0)
& ~ subset(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ subset(X8,X9)
| ~ in(X10,X8)
| in(X10,X9) )
& ( in(esk4_2(X11,X12),X11)
| subset(X11,X12) )
& ( ~ in(esk4_2(X11,X12),X12)
| subset(X11,X12) ) ),
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])])])])])]) ).
cnf(c_0_9,plain,
( in(ordered_pair(X1,X2),X3)
| ~ in(X1,X4)
| X4 != fiber(X3,X2)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ subset(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X29,X30,X31] :
( ( in(X29,X31)
| ~ in(X29,relation_restriction(X31,X30))
| ~ relation(X31) )
& ( in(X29,cartesian_product2(X30,X30))
| ~ in(X29,relation_restriction(X31,X30))
| ~ relation(X31) )
& ( ~ in(X29,X31)
| ~ in(X29,cartesian_product2(X30,X30))
| in(X29,relation_restriction(X31,X30))
| ~ relation(X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])]) ).
cnf(c_0_13,plain,
( in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| ~ in(X1,fiber(X3,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
in(esk4_2(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)),fiber(relation_restriction(esk3_0,esk1_0),esk2_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( X1 = X2
| in(X1,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != fiber(X3,X2)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| ~ in(X1,relation_restriction(X2,X3))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( in(ordered_pair(esk4_2(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)),esk2_0),relation_restriction(esk3_0,esk1_0))
| ~ relation(relation_restriction(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( X1 = X2
| in(X1,fiber(X3,X2))
| ~ relation(X3)
| ~ in(ordered_pair(X1,X2),X3) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( in(ordered_pair(esk4_2(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)),esk2_0),esk3_0)
| ~ relation(relation_restriction(esk3_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
~ in(esk4_2(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)),fiber(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_23,plain,
( X1 != X2
| ~ in(X1,X3)
| X3 != fiber(X4,X2)
| ~ relation(X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( esk4_2(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)) = esk2_0
| ~ relation(relation_restriction(esk3_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| ~ in(X2,fiber(X1,X2)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
fof(c_0_26,plain,
! [X27,X28] :
( ~ relation(X27)
| relation(relation_restriction(X27,X28)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])]) ).
cnf(c_0_27,negated_conjecture,
~ relation(relation_restriction(esk3_0,esk1_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SEU251+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 09:18:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.ATWVV1rtw1/E---3.1_26288.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 26370 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.21/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.21/0.52 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26376 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.21/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 40
% 0.21/0.52 # Removed by relevancy pruning/SinE : 9
% 0.21/0.52 # Initial clauses : 49
% 0.21/0.52 # Removed in clause preprocessing : 2
% 0.21/0.52 # Initial clauses in saturation : 47
% 0.21/0.52 # Processed clauses : 213
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 26
% 0.21/0.52 # ...remaining for further processing : 185
% 0.21/0.52 # Other redundant clauses eliminated : 4
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 22
% 0.21/0.52 # Backward-rewritten : 8
% 0.21/0.52 # Generated clauses : 204
% 0.21/0.52 # ...of the previous two non-redundant : 185
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 2
% 0.21/0.52 # Paramodulations : 201
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 4
% 0.21/0.52 # Total rewrite steps : 59
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 105
% 0.21/0.52 # Positive orientable unit clauses : 35
% 0.21/0.52 # Positive unorientable unit clauses: 2
% 0.21/0.52 # Negative unit clauses : 24
% 0.21/0.52 # Non-unit-clauses : 44
% 0.21/0.52 # Current number of unprocessed clauses: 56
% 0.21/0.52 # ...number of literals in the above : 115
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 77
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 708
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 550
% 0.21/0.52 # Non-unit clause-clause subsumptions : 21
% 0.21/0.52 # Unit Clause-clause subsumption calls : 212
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 20
% 0.21/0.52 # BW rewrite match successes : 12
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 4764
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.017 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 1872 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.019 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.023 s
% 0.21/0.52 # Maximum resident set size: 1704 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------