TSTP Solution File: SEU032+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU032+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:36 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 116 ( 27 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 148 ( 59 ~; 56 |; 19 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(X1)
& relation_rng(X1) = relation_dom(X2)
& relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
=> X2 = function_inverse(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.koa2yDTZ4x/E---3.1_13144.p',t63_funct_1) ).
fof(t61_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_composition(X1,function_inverse(X1)) = identity_relation(relation_dom(X1))
& relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.koa2yDTZ4x/E---3.1_13144.p',t61_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( relation(function_inverse(X1))
& function(function_inverse(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.koa2yDTZ4x/E---3.1_13144.p',dt_k2_funct_1) ).
fof(t62_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> one_to_one(function_inverse(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.koa2yDTZ4x/E---3.1_13144.p',t62_funct_1) ).
fof(t55_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.koa2yDTZ4x/E---3.1_13144.p',t55_funct_1) ).
fof(t65_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> function_inverse(function_inverse(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.koa2yDTZ4x/E---3.1_13144.p',t65_funct_1) ).
fof(c_0_6,plain,
! [X9,X10] :
( ~ relation(X9)
| ~ function(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| relation_rng(X9) != relation_dom(X10)
| relation_composition(X9,X10) != identity_relation(relation_dom(X9))
| X10 = function_inverse(X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t63_funct_1])])]) ).
fof(c_0_7,plain,
! [X7] :
( ( relation_composition(X7,function_inverse(X7)) = identity_relation(relation_dom(X7))
| ~ one_to_one(X7)
| ~ relation(X7)
| ~ function(X7) )
& ( relation_composition(function_inverse(X7),X7) = identity_relation(relation_rng(X7))
| ~ one_to_one(X7)
| ~ relation(X7)
| ~ function(X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_funct_1])])]) ).
fof(c_0_8,plain,
! [X5] :
( ( relation(function_inverse(X5))
| ~ relation(X5)
| ~ function(X5) )
& ( function(function_inverse(X5))
| ~ relation(X5)
| ~ function(X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])]) ).
fof(c_0_9,plain,
! [X8] :
( ~ relation(X8)
| ~ function(X8)
| ~ one_to_one(X8)
| one_to_one(function_inverse(X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t62_funct_1])]) ).
fof(c_0_10,plain,
! [X6] :
( ( relation_rng(X6) = relation_dom(function_inverse(X6))
| ~ one_to_one(X6)
| ~ relation(X6)
| ~ function(X6) )
& ( relation_dom(X6) = relation_rng(function_inverse(X6))
| ~ one_to_one(X6)
| ~ relation(X6)
| ~ function(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_funct_1])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> function_inverse(function_inverse(X1)) = X1 ) ),
inference(assume_negation,[status(cth)],[t65_funct_1]) ).
cnf(c_0_12,plain,
( X2 = function_inverse(X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ one_to_one(X1)
| relation_rng(X1) != relation_dom(X2)
| relation_composition(X1,X2) != identity_relation(relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( function(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( relation(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( one_to_one(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( relation_dom(X1) = relation_rng(function_inverse(X1))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,negated_conjecture,
( relation(esk1_0)
& function(esk1_0)
& one_to_one(esk1_0)
& function_inverse(function_inverse(esk1_0)) != esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_19,plain,
( function_inverse(function_inverse(X1)) = X1
| identity_relation(relation_dom(function_inverse(X1))) != identity_relation(relation_rng(X1))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
( relation_rng(X1) = relation_dom(function_inverse(X1))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
function_inverse(function_inverse(esk1_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( function_inverse(function_inverse(X1)) = X1
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
one_to_one(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU032+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.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:25:06 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.koa2yDTZ4x/E---3.1_13144.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 13223 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FHUSS-FFMM21-SFFFFFNN
% 0.17/0.47 # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.47 # SAT001_MinMin_p005000_rr_RG with pid 13226 completed with status 0
% 0.17/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FHUSS-FFMM21-SFFFFFNN
% 0.17/0.47 # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 44
% 0.17/0.47 # Removed by relevancy pruning/SinE : 17
% 0.17/0.47 # Initial clauses : 48
% 0.17/0.47 # Removed in clause preprocessing : 2
% 0.17/0.47 # Initial clauses in saturation : 46
% 0.17/0.47 # Processed clauses : 299
% 0.17/0.47 # ...of these trivial : 3
% 0.17/0.47 # ...subsumed : 127
% 0.17/0.47 # ...remaining for further processing : 169
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 13
% 0.17/0.47 # Backward-rewritten : 10
% 0.17/0.47 # Generated clauses : 764
% 0.17/0.47 # ...of the previous two non-redundant : 655
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 34
% 0.17/0.47 # Paramodulations : 763
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 1
% 0.17/0.47 # Total rewrite steps : 120
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 102
% 0.17/0.47 # Positive orientable unit clauses : 18
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 4
% 0.17/0.47 # Non-unit-clauses : 80
% 0.17/0.47 # Current number of unprocessed clauses: 348
% 0.17/0.47 # ...number of literals in the above : 2007
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 67
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 1858
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 1278
% 0.17/0.47 # Non-unit clause-clause subsumptions : 151
% 0.17/0.47 # Unit Clause-clause subsumption calls : 32
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 5
% 0.17/0.47 # BW rewrite match successes : 5
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 11634
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.017 s
% 0.17/0.47 # System time : 0.004 s
% 0.17/0.47 # Total time : 0.021 s
% 0.17/0.47 # Maximum resident set size: 1900 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.017 s
% 0.17/0.47 # System time : 0.007 s
% 0.17/0.47 # Total time : 0.024 s
% 0.17/0.47 # Maximum resident set size: 1716 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------