TSTP Solution File: SEU020+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU020+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 81 ( 14 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 87 ( 31 ~; 28 |; 18 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 1 sgn; 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t53_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ? [X2] :
( relation(X2)
& function(X2)
& relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
=> one_to_one(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.RY6FmlfLdA/E---3.1_26002.p',t53_funct_1) ).
fof(t47_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(relation_composition(X2,X1))
& subset(relation_rng(X2),relation_dom(X1)) )
=> one_to_one(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RY6FmlfLdA/E---3.1_26002.p',t47_funct_1) ).
fof(t27_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( relation_dom(relation_composition(X2,X1)) = relation_dom(X2)
=> subset(relation_rng(X2),relation_dom(X1)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RY6FmlfLdA/E---3.1_26002.p',t27_funct_1) ).
fof(t52_funct_1,axiom,
! [X1] : one_to_one(identity_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.RY6FmlfLdA/E---3.1_26002.p',t52_funct_1) ).
fof(t71_relat_1,axiom,
! [X1] :
( relation_dom(identity_relation(X1)) = X1
& relation_rng(identity_relation(X1)) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.RY6FmlfLdA/E---3.1_26002.p',t71_relat_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ? [X2] :
( relation(X2)
& function(X2)
& relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
=> one_to_one(X1) ) ),
inference(assume_negation,[status(cth)],[t53_funct_1]) ).
fof(c_0_6,plain,
! [X44,X45] :
( ~ relation(X44)
| ~ function(X44)
| ~ relation(X45)
| ~ function(X45)
| ~ one_to_one(relation_composition(X45,X44))
| ~ subset(relation_rng(X45),relation_dom(X44))
| one_to_one(X45) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t47_funct_1])])]) ).
fof(c_0_7,plain,
! [X38,X39] :
( ~ relation(X38)
| ~ function(X38)
| ~ relation(X39)
| ~ function(X39)
| relation_dom(relation_composition(X39,X38)) != relation_dom(X39)
| subset(relation_rng(X39),relation_dom(X38)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t27_funct_1])])]) ).
fof(c_0_8,plain,
! [X49] : one_to_one(identity_relation(X49)),
inference(variable_rename,[status(thm)],[t52_funct_1]) ).
fof(c_0_9,negated_conjecture,
( relation(esk10_0)
& function(esk10_0)
& relation(esk11_0)
& function(esk11_0)
& relation_composition(esk10_0,esk11_0) = identity_relation(relation_dom(esk10_0))
& ~ one_to_one(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_10,plain,
! [X56] :
( relation_dom(identity_relation(X56)) = X56
& relation_rng(identity_relation(X56)) = X56 ),
inference(variable_rename,[status(thm)],[t71_relat_1]) ).
cnf(c_0_11,plain,
( one_to_one(X2)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ one_to_one(relation_composition(X2,X1))
| ~ subset(relation_rng(X2),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( subset(relation_rng(X2),relation_dom(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| relation_dom(relation_composition(X2,X1)) != relation_dom(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
one_to_one(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
relation_composition(esk10_0,esk11_0) = identity_relation(relation_dom(esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
relation_dom(identity_relation(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( one_to_one(X1)
| relation_dom(relation_composition(X1,X2)) != relation_dom(X1)
| ~ one_to_one(relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X1)
| ~ function(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
one_to_one(relation_composition(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
relation(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
function(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
function(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
~ one_to_one(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
relation_dom(relation_composition(esk10_0,esk11_0)) = relation_dom(esk10_0),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SEU020+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n005.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 09:23:01 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.RY6FmlfLdA/E---3.1_26002.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26080 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.52 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.20/0.52 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 26088 completed with status 0
% 0.20/0.52 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 40
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 62
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 62
% 0.20/0.52 # Processed clauses : 79
% 0.20/0.52 # ...of these trivial : 4
% 0.20/0.52 # ...subsumed : 2
% 0.20/0.52 # ...remaining for further processing : 72
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 5
% 0.20/0.52 # Generated clauses : 63
% 0.20/0.52 # ...of the previous two non-redundant : 57
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 63
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 35
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 67
% 0.20/0.52 # Positive orientable unit clauses : 29
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 4
% 0.20/0.52 # Non-unit-clauses : 34
% 0.20/0.52 # Current number of unprocessed clauses: 40
% 0.20/0.52 # ...number of literals in the above : 107
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 5
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 141
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 103
% 0.20/0.52 # Non-unit clause-clause subsumptions : 2
% 0.20/0.52 # Unit Clause-clause subsumption calls : 7
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 3
% 0.20/0.52 # BW rewrite match successes : 3
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 3351
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.007 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.012 s
% 0.20/0.52 # Maximum resident set size: 1844 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.025 s
% 0.20/0.52 # System time : 0.013 s
% 0.20/0.52 # Total time : 0.037 s
% 0.20/0.52 # Maximum resident set size: 1704 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------