TSTP Solution File: CAT004-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CAT004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:27:20 EDT 2024
% Result : Unsatisfiable 2.56s 0.81s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 46 ( 19 unt; 0 nHn; 46 RR)
% Number of literals : 90 ( 13 equ; 47 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 78 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associative_property1,axiom,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',associative_property1) ).
cnf(category_theory_axiom3,axiom,
( defined(X4,X1)
| ~ product(X1,X2,X3)
| ~ defined(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',category_theory_axiom3) ).
cnf(gc_equals_d,hypothesis,
product(g,c,d),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',gc_equals_d) ).
cnf(hc_equals_d,hypothesis,
product(h,c,d),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',hc_equals_d) ).
cnf(category_theory_axiom5,axiom,
( product(X6,X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X3,X5)
| ~ product(X4,X1,X6) ),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',category_theory_axiom5) ).
cnf(closure_of_composition,axiom,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',closure_of_composition) ).
cnf(ab_equals_c,hypothesis,
product(a,b,c),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',ab_equals_c) ).
cnf(cancellation_for_product2,hypothesis,
( X1 = X3
| ~ product(X1,b,X2)
| ~ product(X3,b,X2) ),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',cancellation_for_product2) ).
cnf(cancellation_for_product1,hypothesis,
( X1 = X3
| ~ product(X1,a,X2)
| ~ product(X3,a,X2) ),
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',cancellation_for_product1) ).
cnf(prove_h_equals_g,negated_conjecture,
h != g,
file('/export/starexec/sandbox/tmp/tmp.sh7nfUZJDm/E---3.1_6907.p',prove_h_equals_g) ).
cnf(c_0_10,plain,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associative_property1]) ).
cnf(c_0_11,plain,
( defined(X4,X1)
| ~ product(X1,X2,X3)
| ~ defined(X4,X3) ),
inference(fof_simplification,[status(thm)],[category_theory_axiom3]) ).
cnf(c_0_12,plain,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_13,hypothesis,
product(g,c,d),
gc_equals_d ).
cnf(c_0_14,plain,
( defined(X4,X1)
| ~ product(X1,X2,X3)
| ~ defined(X4,X3) ),
c_0_11 ).
cnf(c_0_15,hypothesis,
defined(g,c),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,hypothesis,
product(h,c,d),
hc_equals_d ).
cnf(c_0_17,plain,
( product(X6,X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X3,X5)
| ~ product(X4,X1,X6) ),
inference(fof_simplification,[status(thm)],[category_theory_axiom5]) ).
cnf(c_0_18,plain,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
inference(fof_simplification,[status(thm)],[closure_of_composition]) ).
cnf(c_0_19,hypothesis,
( defined(g,X1)
| ~ product(X1,X2,c) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
product(a,b,c),
ab_equals_c ).
cnf(c_0_21,hypothesis,
defined(h,c),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_22,plain,
( product(X6,X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X3,X5)
| ~ product(X4,X1,X6) ),
c_0_17 ).
cnf(c_0_23,plain,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
c_0_18 ).
cnf(c_0_24,hypothesis,
defined(g,a),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
( defined(h,X1)
| ~ product(X1,X2,c) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_26,hypothesis,
( product(X1,X2,d)
| ~ product(g,X3,X1)
| ~ product(X3,X2,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_27,hypothesis,
product(g,a,compose(g,a)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
defined(h,a),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,hypothesis,
( X1 = X3
| ~ product(X1,b,X2)
| ~ product(X3,b,X2) ),
inference(fof_simplification,[status(thm)],[cancellation_for_product2]) ).
cnf(c_0_30,hypothesis,
( product(compose(g,a),X1,d)
| ~ product(a,X1,c) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,hypothesis,
( product(X1,X2,d)
| ~ product(h,X3,X1)
| ~ product(X3,X2,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_32,hypothesis,
product(h,a,compose(h,a)),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_33,hypothesis,
( X1 = X3
| ~ product(X1,a,X2)
| ~ product(X3,a,X2) ),
inference(fof_simplification,[status(thm)],[cancellation_for_product1]) ).
cnf(c_0_34,hypothesis,
( X1 = X3
| ~ product(X1,b,X2)
| ~ product(X3,b,X2) ),
c_0_29 ).
cnf(c_0_35,hypothesis,
product(compose(g,a),b,d),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_36,hypothesis,
( product(compose(h,a),X1,d)
| ~ product(a,X1,c) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,hypothesis,
( X1 = X3
| ~ product(X1,a,X2)
| ~ product(X3,a,X2) ),
c_0_33 ).
cnf(c_0_38,hypothesis,
( X1 = compose(g,a)
| ~ product(X1,b,d) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,hypothesis,
product(compose(h,a),b,d),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_40,hypothesis,
( X1 = g
| ~ product(X1,a,compose(g,a)) ),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_41,hypothesis,
compose(g,a) = compose(h,a),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
h != g,
inference(fof_simplification,[status(thm)],[prove_h_equals_g]) ).
cnf(c_0_43,hypothesis,
( X1 = g
| ~ product(X1,a,compose(h,a)) ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
h != g,
c_0_42 ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : CAT004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:32:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/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.sh7nfUZJDm/E---3.1_6907.p
% 2.56/0.81 # Version: 3.1.0
% 2.56/0.81 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.56/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.56/0.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.56/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.56/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.56/0.81 # Starting sh5l with 300s (1) cores
% 2.56/0.81 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6994 completed with status 0
% 2.56/0.81 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.56/0.81 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.56/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.56/0.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.56/0.81 # No SInE strategy applied
% 2.56/0.81 # Search class: FHUSM-FFSS21-SFFFFFNN
% 2.56/0.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.56/0.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 2.56/0.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.56/0.81 # Starting new_bool_3 with 136s (1) cores
% 2.56/0.81 # Starting new_bool_1 with 136s (1) cores
% 2.56/0.81 # Starting sh5l with 136s (1) cores
% 2.56/0.81 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 6999 completed with status 0
% 2.56/0.81 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 2.56/0.81 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.56/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.56/0.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.56/0.81 # No SInE strategy applied
% 2.56/0.81 # Search class: FHUSM-FFSS21-SFFFFFNN
% 2.56/0.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.56/0.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 2.56/0.81 # Preprocessing time : 0.001 s
% 2.56/0.81 # Presaturation interreduction done
% 2.56/0.81
% 2.56/0.81 # Proof found!
% 2.56/0.81 # SZS status Unsatisfiable
% 2.56/0.81 # SZS output start CNFRefutation
% See solution above
% 2.56/0.81 # Parsed axioms : 24
% 2.56/0.81 # Removed by relevancy pruning/SinE : 0
% 2.56/0.81 # Initial clauses : 24
% 2.56/0.81 # Removed in clause preprocessing : 0
% 2.56/0.81 # Initial clauses in saturation : 24
% 2.56/0.81 # Processed clauses : 4833
% 2.56/0.81 # ...of these trivial : 358
% 2.56/0.81 # ...subsumed : 2433
% 2.56/0.81 # ...remaining for further processing : 2042
% 2.56/0.81 # Other redundant clauses eliminated : 0
% 2.56/0.81 # Clauses deleted for lack of memory : 0
% 2.56/0.81 # Backward-subsumed : 15
% 2.56/0.81 # Backward-rewritten : 461
% 2.56/0.81 # Generated clauses : 15851
% 2.56/0.81 # ...of the previous two non-redundant : 12073
% 2.56/0.81 # ...aggressively subsumed : 0
% 2.56/0.81 # Contextual simplify-reflections : 0
% 2.56/0.81 # Paramodulations : 15851
% 2.56/0.81 # Factorizations : 0
% 2.56/0.81 # NegExts : 0
% 2.56/0.81 # Equation resolutions : 0
% 2.56/0.81 # Disequality decompositions : 0
% 2.56/0.81 # Total rewrite steps : 12910
% 2.56/0.81 # ...of those cached : 12344
% 2.56/0.81 # Propositional unsat checks : 0
% 2.56/0.81 # Propositional check models : 0
% 2.56/0.81 # Propositional check unsatisfiable : 0
% 2.56/0.81 # Propositional clauses : 0
% 2.56/0.81 # Propositional clauses after purity: 0
% 2.56/0.81 # Propositional unsat core size : 0
% 2.56/0.81 # Propositional preprocessing time : 0.000
% 2.56/0.81 # Propositional encoding time : 0.000
% 2.56/0.81 # Propositional solver time : 0.000
% 2.56/0.81 # Success case prop preproc time : 0.000
% 2.56/0.81 # Success case prop encoding time : 0.000
% 2.56/0.81 # Success case prop solver time : 0.000
% 2.56/0.81 # Current number of processed clauses : 1542
% 2.56/0.81 # Positive orientable unit clauses : 279
% 2.56/0.81 # Positive unorientable unit clauses: 0
% 2.56/0.81 # Negative unit clauses : 1
% 2.56/0.81 # Non-unit-clauses : 1262
% 2.56/0.81 # Current number of unprocessed clauses: 6783
% 2.56/0.81 # ...number of literals in the above : 13722
% 2.56/0.81 # Current number of archived formulas : 0
% 2.56/0.81 # Current number of archived clauses : 500
% 2.56/0.81 # Clause-clause subsumption calls (NU) : 335844
% 2.56/0.81 # Rec. Clause-clause subsumption calls : 290843
% 2.56/0.81 # Non-unit clause-clause subsumptions : 2448
% 2.56/0.81 # Unit Clause-clause subsumption calls : 1213
% 2.56/0.81 # Rewrite failures with RHS unbound : 0
% 2.56/0.81 # BW rewrite match attempts : 697
% 2.56/0.81 # BW rewrite match successes : 55
% 2.56/0.81 # Condensation attempts : 0
% 2.56/0.81 # Condensation successes : 0
% 2.56/0.81 # Termbank termtop insertions : 194910
% 2.56/0.81 # Search garbage collected termcells : 68
% 2.56/0.81
% 2.56/0.81 # -------------------------------------------------
% 2.56/0.81 # User time : 0.289 s
% 2.56/0.81 # System time : 0.010 s
% 2.56/0.81 # Total time : 0.299 s
% 2.56/0.81 # Maximum resident set size: 1644 pages
% 2.56/0.81
% 2.56/0.81 # -------------------------------------------------
% 2.56/0.81 # User time : 1.454 s
% 2.56/0.81 # System time : 0.025 s
% 2.56/0.81 # Total time : 1.480 s
% 2.56/0.81 # Maximum resident set size: 1708 pages
% 2.56/0.81 % E---3.1 exiting
% 2.56/0.81 % E exiting
%------------------------------------------------------------------------------