TSTP Solution File: SEU019+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU019+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:24:35 EDT 2023
% Result : Timeout 23.99s 300.18s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 111 ( 31 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 130 ( 50 ~; 60 |; 14 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.193vSTzp89/E---3.1_25497.p',t34_funct_1) ).
fof(dt_k6_relat_1,axiom,
! [X1] : relation(identity_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.193vSTzp89/E---3.1_25497.p',dt_k6_relat_1) ).
fof(fc2_funct_1,axiom,
! [X1] :
( relation(identity_relation(X1))
& function(identity_relation(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.193vSTzp89/E---3.1_25497.p',fc2_funct_1) ).
fof(d8_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
& in(X3,relation_dom(X1))
& apply(X1,X2) = apply(X1,X3) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.193vSTzp89/E---3.1_25497.p',d8_funct_1) ).
fof(t52_funct_1,conjecture,
! [X1] : one_to_one(identity_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.193vSTzp89/E---3.1_25497.p',t52_funct_1) ).
fof(c_0_5,plain,
! [X12,X13,X14] :
( ( relation_dom(X13) = X12
| X13 != identity_relation(X12)
| ~ relation(X13)
| ~ function(X13) )
& ( ~ in(X14,X12)
| apply(X13,X14) = X14
| X13 != identity_relation(X12)
| ~ relation(X13)
| ~ function(X13) )
& ( in(esk4_2(X12,X13),X12)
| relation_dom(X13) != X12
| X13 = identity_relation(X12)
| ~ relation(X13)
| ~ function(X13) )
& ( apply(X13,esk4_2(X12,X13)) != esk4_2(X12,X13)
| relation_dom(X13) != X12
| X13 = identity_relation(X12)
| ~ relation(X13)
| ~ function(X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_funct_1])])])])]) ).
fof(c_0_6,plain,
! [X10] : relation(identity_relation(X10)),
inference(variable_rename,[status(thm)],[dt_k6_relat_1]) ).
fof(c_0_7,plain,
! [X11] :
( relation(identity_relation(X11))
& function(identity_relation(X11)) ),
inference(variable_rename,[status(thm)],[fc2_funct_1]) ).
fof(c_0_8,plain,
! [X5,X6,X7] :
( ( ~ one_to_one(X5)
| ~ in(X6,relation_dom(X5))
| ~ in(X7,relation_dom(X5))
| apply(X5,X6) != apply(X5,X7)
| X6 = X7
| ~ relation(X5)
| ~ function(X5) )
& ( in(esk2_1(X5),relation_dom(X5))
| one_to_one(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( in(esk3_1(X5),relation_dom(X5))
| one_to_one(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( apply(X5,esk2_1(X5)) = apply(X5,esk3_1(X5))
| one_to_one(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( esk2_1(X5) != esk3_1(X5)
| one_to_one(X5)
| ~ relation(X5)
| ~ function(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_funct_1])])])])]) ).
cnf(c_0_9,plain,
( relation_dom(X1) = X2
| X1 != identity_relation(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
function(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( apply(X3,X1) = X1
| ~ in(X1,X2)
| X3 != identity_relation(X2)
| ~ relation(X3)
| ~ function(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( in(esk3_1(X1),relation_dom(X1))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
relation_dom(identity_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_15,plain,
( in(esk2_1(X1),relation_dom(X1))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( apply(X1,esk2_1(X1)) = apply(X1,esk3_1(X1))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( apply(identity_relation(X1),X2) = X2
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_10]),c_0_11])]) ).
cnf(c_0_18,plain,
( one_to_one(identity_relation(X1))
| in(esk3_1(identity_relation(X1)),X1) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_11])]),c_0_14]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1] : one_to_one(identity_relation(X1)),
inference(assume_negation,[status(cth)],[t52_funct_1]) ).
cnf(c_0_20,plain,
( one_to_one(identity_relation(X1))
| in(esk2_1(identity_relation(X1)),X1) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_11])]),c_0_14]) ).
cnf(c_0_21,plain,
( apply(identity_relation(X1),esk3_1(identity_relation(X1))) = apply(identity_relation(X1),esk2_1(identity_relation(X1)))
| one_to_one(identity_relation(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11])]) ).
cnf(c_0_22,plain,
( apply(identity_relation(X1),esk3_1(identity_relation(X1))) = esk3_1(identity_relation(X1))
| one_to_one(identity_relation(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_24,negated_conjecture,
~ one_to_one(identity_relation(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_25,plain,
( apply(identity_relation(X1),esk2_1(identity_relation(X1))) = esk2_1(identity_relation(X1))
| one_to_one(identity_relation(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_26,plain,
( apply(identity_relation(X1),esk2_1(identity_relation(X1))) = esk3_1(identity_relation(X1))
| one_to_one(identity_relation(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( one_to_one(identity_relation(X1))
| esk3_1(identity_relation(X1)) != esk2_1(identity_relation(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_10]),c_0_11])]) ).
cnf(c_0_28,negated_conjecture,
~ one_to_one(identity_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
one_to_one(identity_relation(X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU019+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.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 08:57:06 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/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.193vSTzp89/E---3.1_25497.p
% 23.99/300.18 # Version: 3.1pre001
% 23.99/300.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 23.99/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.99/300.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.99/300.18 # Starting new_bool_3 with 300s (1) cores
% 23.99/300.18 # Starting new_bool_1 with 300s (1) cores
% 23.99/300.18 # Starting sh5l with 300s (1) cores
% 23.99/300.18 # new_bool_1 with pid 25637 completed with status 0
% 23.99/300.18 # Result found by new_bool_1
% 23.99/300.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 23.99/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.99/300.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.99/300.18 # Starting new_bool_3 with 300s (1) cores
% 23.99/300.18 # Starting new_bool_1 with 300s (1) cores
% 23.99/300.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.99/300.18 # Search class: FGHSM-FFMM21-SFFFFFNN
% 23.99/300.18 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 23.99/300.18 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 23.99/300.18 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 25642 completed with status 0
% 23.99/300.18 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 23.99/300.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 23.99/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.99/300.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.99/300.18 # Starting new_bool_3 with 300s (1) cores
% 23.99/300.18 # Starting new_bool_1 with 300s (1) cores
% 23.99/300.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.99/300.18 # Search class: FGHSM-FFMM21-SFFFFFNN
% 23.99/300.18 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 23.99/300.18 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 23.99/300.18 # Preprocessing time : 0.002 s
% 23.99/300.18
% 23.99/300.18 # Proof found!
% 23.99/300.18 # SZS status Theorem
% 23.99/300.18 # SZS output start CNFRefutation
% See solution above
% 23.99/300.18 # Parsed axioms : 32
% 23.99/300.18 # Removed by relevancy pruning/SinE : 7
% 23.99/300.18 # Initial clauses : 39
% 23.99/300.18 # Removed in clause preprocessing : 0
% 23.99/300.18 # Initial clauses in saturation : 39
% 23.99/300.18 # Processed clauses : 166
% 23.99/300.18 # ...of these trivial : 9
% 23.99/300.18 # ...subsumed : 27
% 23.99/300.18 # ...remaining for further processing : 130
% 23.99/300.18 # Other redundant clauses eliminated : 4
% 23.99/300.18 # Clauses deleted for lack of memory : 0
% 23.99/300.18 # Backward-subsumed : 3
% 23.99/300.18 # Backward-rewritten : 48
% 23.99/300.18 # Generated clauses : 283
% 23.99/300.18 # ...of the previous two non-redundant : 210
% 23.99/300.18 # ...aggressively subsumed : 0
% 23.99/300.18 # Contextual simplify-reflections : 2
% 23.99/300.18 # Paramodulations : 279
% 23.99/300.18 # Factorizations : 0
% 23.99/300.18 # NegExts : 0
% 23.99/300.18 # Equation resolutions : 4
% 23.99/300.18 # Total rewrite steps : 211
% 23.99/300.18 # Propositional unsat checks : 0
% 23.99/300.18 # Propositional check models : 0
% 23.99/300.18 # Propositional check unsatisfiable : 0
% 23.99/300.18 # Propositional clauses : 0
% 23.99/300.18 # Propositional clauses after purity: 0
% 23.99/300.18 # Propositional unsat core size : 0
% 23.99/300.18 # Propositional preprocessing time : 0.000
% 23.99/300.18 # Propositional encoding time : 0.000
% 23.99/300.18 # Propositional solver time : 0.000
% 23.99/300.18 # Success case prop preproc time : 0.000
% 23.99/300.18 # Success case prop encoding time : 0.000
% 23.99/300.18 # Success case prop solver time : 0.000
% 23.99/300.18 # Current number of processed clauses : 75
% 23.99/300.18 # Positive orientable unit clauses : 20
% 23.99/300.18 # Positive unorientable unit clauses: 0
% 23.99/300.18 # Negative unit clauses : 4
% 23.99/300.18 # Non-unit-clauses : 51
% 23.99/300.18 # Current number of unprocessed clauses: 19
% 23.99/300.18 # ...number of literals in the above : 64
% 23.99/300.18 # Current number of archived formulas : 0
% 23.99/300.18 # Current number of archived clauses : 51
% 23.99/300.18 # Clause-clause subsumption calls (NU) : 621
% 23.99/300.18 # Rec. Clause-clause subsumption calls : 500
% 23.99/300.18 # Non-unit clause-clause subsumptions : 18
% 23.99/300.18 # Unit Clause-clause subsumption calls : 59
% 23.99/300.18 # Rewrite failures with RHS unbound : 0
% 23.99/300.18 # BW rewrite match attempts : 17
% 23.99/300.18 # BW rewrite match successes : 15
% 23.99/300.18 # Condensation attempts : 0
% 23.99/300.18 # Condensation successes : 0
% 23.99/300.18 # Termbank termtop insertions : 5804
% 23.99/300.18
% 23.99/300.18 # -------------------------------------------------
% 23.99/300.18 # User time : 0.017 s
% 23.99/300.18 # System time : 0.000 s
% 23.99/300.18 # Total time : 0.017 s
% 23.99/300.18 # Maximum resident set size: 1852 pages
% 23.99/300.18
% 23.99/300.18 # -------------------------------------------------
% 23.99/300.18 # User time : 0.018 s
% 23.99/300.18 # System time : 0.003 s
% 23.99/300.18 # Total time : 0.020 s
% 23.99/300.18 # Maximum resident set size: 1696 pages
% 23.99/300.18 % E---3.1 exiting
% 23.99/300.18 % E---3.1 exiting
%------------------------------------------------------------------------------