TSTP Solution File: HAL004+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HAL004+1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 17:50:43 EDT 2023
% Result : Theorem 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 45 ( 16 unt; 0 def)
% Number of atoms : 144 ( 33 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 183 ( 84 ~; 73 |; 18 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-4 aty)
% Number of variables : 97 ( 0 sgn; 38 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(commute_properties,axiom,
! [X13,X14,X15,X16,X2,X17,X18,X3] :
( ( commute(X13,X14,X15,X16)
& morphism(X13,X2,X17)
& morphism(X14,X17,X3)
& morphism(X15,X2,X18)
& morphism(X16,X18,X3) )
=> ! [X8] :
( element(X8,X2)
=> apply(X14,apply(X13,X8)) = apply(X16,apply(X15,X8)) ) ),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',commute_properties) ).
fof(lemma3,conjecture,
! [X19] :
( element(X19,e)
=> ? [X20,X21] :
( element(X20,r)
& apply(delta,X19) = X20
& element(X21,b)
& apply(h,apply(beta,X21)) = X20
& apply(delta,apply(g,X21)) = X20 ) ),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',lemma3) ).
fof(beta_h_g_delta_commute,axiom,
commute(beta,h,g,delta),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',beta_h_g_delta_commute) ).
fof(morphism,axiom,
! [X1,X2,X3] :
( morphism(X1,X2,X3)
=> ( ! [X4] :
( element(X4,X2)
=> element(apply(X1,X4),X3) )
& apply(X1,zero(X2)) = zero(X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',morphism) ).
fof(delta_morphism,axiom,
morphism(delta,e,r),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',delta_morphism) ).
fof(g_morphism,axiom,
morphism(g,b,e),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',g_morphism) ).
fof(h_morphism,axiom,
morphism(h,c,r),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',h_morphism) ).
fof(beta_morphism,axiom,
morphism(beta,b,c),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',beta_morphism) ).
fof(surjection_properties,axiom,
! [X1,X2,X3] :
( ( surjection(X1)
& morphism(X1,X2,X3) )
=> ! [X7] :
( element(X7,X3)
=> ? [X8] :
( element(X8,X2)
& apply(X1,X8) = X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',surjection_properties) ).
fof(beta_surjection,axiom,
surjection(beta),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',beta_surjection) ).
fof(h_surjection,hypothesis,
surjection(h),
file('/export/starexec/sandbox/tmp/tmp.2OXiKQTXOu/E---3.1_25808.p',h_surjection) ).
fof(c_0_11,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42,X43] :
( ~ commute(X35,X36,X37,X38)
| ~ morphism(X35,X39,X40)
| ~ morphism(X36,X40,X42)
| ~ morphism(X37,X39,X41)
| ~ morphism(X38,X41,X42)
| ~ element(X43,X39)
| apply(X36,apply(X35,X43)) = apply(X38,apply(X37,X43)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commute_properties])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X19] :
( element(X19,e)
=> ? [X20,X21] :
( element(X20,r)
& apply(delta,X19) = X20
& element(X21,b)
& apply(h,apply(beta,X21)) = X20
& apply(delta,apply(g,X21)) = X20 ) ),
inference(assume_negation,[status(cth)],[lemma3]) ).
cnf(c_0_13,plain,
( apply(X2,apply(X1,X9)) = apply(X4,apply(X3,X9))
| ~ commute(X1,X2,X3,X4)
| ~ morphism(X1,X5,X6)
| ~ morphism(X2,X6,X7)
| ~ morphism(X3,X5,X8)
| ~ morphism(X4,X8,X7)
| ~ element(X9,X5) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
commute(beta,h,g,delta),
inference(split_conjunct,[status(thm)],[beta_h_g_delta_commute]) ).
fof(c_0_15,negated_conjecture,
! [X23,X24] :
( element(esk1_0,e)
& ( ~ element(X23,r)
| apply(delta,esk1_0) != X23
| ~ element(X24,b)
| apply(h,apply(beta,X24)) != X23
| apply(delta,apply(g,X24)) != X23 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_16,plain,
! [X80,X81,X82,X83] :
( ( ~ element(X83,X81)
| element(apply(X80,X83),X82)
| ~ morphism(X80,X81,X82) )
& ( apply(X80,zero(X81)) = zero(X82)
| ~ morphism(X80,X81,X82) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[morphism])])])]) ).
cnf(c_0_17,plain,
( apply(h,apply(beta,X1)) = apply(delta,apply(g,X1))
| ~ element(X1,X2)
| ~ morphism(delta,X3,X4)
| ~ morphism(g,X2,X3)
| ~ morphism(h,X5,X4)
| ~ morphism(beta,X2,X5) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
morphism(delta,e,r),
inference(split_conjunct,[status(thm)],[delta_morphism]) ).
cnf(c_0_19,negated_conjecture,
( ~ element(X1,r)
| apply(delta,esk1_0) != X1
| ~ element(X2,b)
| apply(h,apply(beta,X2)) != X1
| apply(delta,apply(g,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( element(apply(X3,X1),X4)
| ~ element(X1,X2)
| ~ morphism(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
morphism(g,b,e),
inference(split_conjunct,[status(thm)],[g_morphism]) ).
cnf(c_0_22,plain,
( apply(h,apply(beta,X1)) = apply(delta,apply(g,X1))
| ~ element(X1,X2)
| ~ morphism(g,X2,e)
| ~ morphism(h,X3,r)
| ~ morphism(beta,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( apply(h,apply(beta,X1)) != apply(delta,apply(g,X1))
| apply(delta,apply(g,X1)) != apply(delta,esk1_0)
| ~ element(apply(delta,apply(g,X1)),r)
| ~ element(X1,b) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( element(apply(delta,X1),r)
| ~ element(X1,e) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,plain,
( element(apply(g,X1),e)
| ~ element(X1,b) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( apply(h,apply(beta,X1)) = apply(delta,apply(g,X1))
| ~ element(X1,b)
| ~ morphism(h,X2,r)
| ~ morphism(beta,b,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,plain,
morphism(h,c,r),
inference(split_conjunct,[status(thm)],[h_morphism]) ).
cnf(c_0_28,plain,
morphism(beta,b,c),
inference(split_conjunct,[status(thm)],[beta_morphism]) ).
fof(c_0_29,plain,
! [X25,X26,X27,X28] :
( ( element(esk2_4(X25,X26,X27,X28),X26)
| ~ element(X28,X27)
| ~ surjection(X25)
| ~ morphism(X25,X26,X27) )
& ( apply(X25,esk2_4(X25,X26,X27,X28)) = X28
| ~ element(X28,X27)
| ~ surjection(X25)
| ~ morphism(X25,X26,X27) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[surjection_properties])])])])]) ).
cnf(c_0_30,negated_conjecture,
( apply(h,apply(beta,X1)) != apply(delta,apply(g,X1))
| apply(delta,apply(g,X1)) != apply(delta,esk1_0)
| ~ element(X1,b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
( apply(h,apply(beta,X1)) = apply(delta,apply(g,X1))
| ~ element(X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( apply(X1,esk2_4(X1,X2,X3,X4)) = X4
| ~ element(X4,X3)
| ~ surjection(X1)
| ~ morphism(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
surjection(beta),
inference(split_conjunct,[status(thm)],[beta_surjection]) ).
cnf(c_0_34,negated_conjecture,
( apply(delta,apply(g,X1)) != apply(delta,esk1_0)
| ~ element(X1,b) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( apply(delta,apply(g,esk2_4(beta,X1,X2,X3))) = apply(h,X3)
| ~ element(esk2_4(beta,X1,X2,X3),b)
| ~ element(X3,X2)
| ~ morphism(beta,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
( apply(h,X1) != apply(delta,esk1_0)
| ~ element(esk2_4(beta,X2,X3,X1),b)
| ~ element(X1,X3)
| ~ morphism(beta,X2,X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( element(esk2_4(X1,X2,X3,X4),X2)
| ~ element(X4,X3)
| ~ surjection(X1)
| ~ morphism(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( apply(h,X1) != apply(delta,esk1_0)
| ~ element(X1,X2)
| ~ morphism(beta,b,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
( apply(h,esk2_4(X1,X2,X3,X4)) != apply(delta,esk1_0)
| ~ surjection(X1)
| ~ element(X4,X3)
| ~ morphism(beta,b,X2)
| ~ morphism(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_40,hypothesis,
surjection(h),
inference(split_conjunct,[status(thm)],[h_surjection]) ).
cnf(c_0_41,negated_conjecture,
( ~ element(apply(delta,esk1_0),X1)
| ~ morphism(beta,b,X2)
| ~ morphism(h,X2,X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_40])])]) ).
cnf(c_0_42,negated_conjecture,
element(esk1_0,e),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( ~ morphism(beta,b,X1)
| ~ morphism(h,X1,r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_24]),c_0_42])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HAL004+1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 23:31:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.2OXiKQTXOu/E---3.1_25808.p
% 0.19/0.59 # Version: 3.1pre001
% 0.19/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.59 # Starting sh5l with 300s (1) cores
% 0.19/0.59 # new_bool_3 with pid 25941 completed with status 0
% 0.19/0.59 # Result found by new_bool_3
% 0.19/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.59 # Search class: FGHSF-FFMM33-MFFFFFNN
% 0.19/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 0.19/0.59 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25952 completed with status 0
% 0.19/0.59 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.59 # Search class: FGHSF-FFMM33-MFFFFFNN
% 0.19/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 0.19/0.59 # Preprocessing time : 0.002 s
% 0.19/0.59 # Presaturation interreduction done
% 0.19/0.59
% 0.19/0.59 # Proof found!
% 0.19/0.59 # SZS status Theorem
% 0.19/0.59 # SZS output start CNFRefutation
% See solution above
% 0.19/0.59 # Parsed axioms : 31
% 0.19/0.59 # Removed by relevancy pruning/SinE : 4
% 0.19/0.59 # Initial clauses : 42
% 0.19/0.59 # Removed in clause preprocessing : 0
% 0.19/0.59 # Initial clauses in saturation : 42
% 0.19/0.59 # Processed clauses : 739
% 0.19/0.59 # ...of these trivial : 0
% 0.19/0.59 # ...subsumed : 178
% 0.19/0.59 # ...remaining for further processing : 561
% 0.19/0.59 # Other redundant clauses eliminated : 24
% 0.19/0.59 # Clauses deleted for lack of memory : 0
% 0.19/0.59 # Backward-subsumed : 45
% 0.19/0.59 # Backward-rewritten : 0
% 0.19/0.59 # Generated clauses : 908
% 0.19/0.59 # ...of the previous two non-redundant : 821
% 0.19/0.59 # ...aggressively subsumed : 0
% 0.19/0.59 # Contextual simplify-reflections : 71
% 0.19/0.59 # Paramodulations : 878
% 0.19/0.59 # Factorizations : 0
% 0.19/0.59 # NegExts : 0
% 0.19/0.59 # Equation resolutions : 30
% 0.19/0.59 # Total rewrite steps : 189
% 0.19/0.59 # Propositional unsat checks : 0
% 0.19/0.59 # Propositional check models : 0
% 0.19/0.59 # Propositional check unsatisfiable : 0
% 0.19/0.59 # Propositional clauses : 0
% 0.19/0.59 # Propositional clauses after purity: 0
% 0.19/0.59 # Propositional unsat core size : 0
% 0.19/0.59 # Propositional preprocessing time : 0.000
% 0.19/0.59 # Propositional encoding time : 0.000
% 0.19/0.59 # Propositional solver time : 0.000
% 0.19/0.59 # Success case prop preproc time : 0.000
% 0.19/0.59 # Success case prop encoding time : 0.000
% 0.19/0.59 # Success case prop solver time : 0.000
% 0.19/0.59 # Current number of processed clauses : 472
% 0.19/0.59 # Positive orientable unit clauses : 24
% 0.19/0.59 # Positive unorientable unit clauses: 0
% 0.19/0.59 # Negative unit clauses : 0
% 0.19/0.59 # Non-unit-clauses : 448
% 0.19/0.59 # Current number of unprocessed clauses: 149
% 0.19/0.59 # ...number of literals in the above : 857
% 0.19/0.59 # Current number of archived formulas : 0
% 0.19/0.59 # Current number of archived clauses : 86
% 0.19/0.59 # Clause-clause subsumption calls (NU) : 13882
% 0.19/0.59 # Rec. Clause-clause subsumption calls : 4326
% 0.19/0.59 # Non-unit clause-clause subsumptions : 294
% 0.19/0.59 # Unit Clause-clause subsumption calls : 1
% 0.19/0.59 # Rewrite failures with RHS unbound : 0
% 0.19/0.59 # BW rewrite match attempts : 0
% 0.19/0.59 # BW rewrite match successes : 0
% 0.19/0.59 # Condensation attempts : 0
% 0.19/0.59 # Condensation successes : 0
% 0.19/0.59 # Termbank termtop insertions : 25614
% 0.19/0.59
% 0.19/0.59 # -------------------------------------------------
% 0.19/0.59 # User time : 0.094 s
% 0.19/0.59 # System time : 0.006 s
% 0.19/0.59 # Total time : 0.100 s
% 0.19/0.59 # Maximum resident set size: 1868 pages
% 0.19/0.59
% 0.19/0.59 # -------------------------------------------------
% 0.19/0.59 # User time : 0.095 s
% 0.19/0.59 # System time : 0.010 s
% 0.19/0.59 # Total time : 0.105 s
% 0.19/0.59 # Maximum resident set size: 1740 pages
% 0.19/0.59 % E---3.1 exiting
% 0.19/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------