TSTP Solution File: CAT003-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CAT003-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 18:59:29 EDT 2024
% Result : Unsatisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 17 unt; 0 nHn; 32 RR)
% Number of literals : 65 ( 64 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(codomain_domain2,axiom,
( codomain(compose(X1,X2)) = codomain(X2)
| codomain(X1) != domain(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT002-0.ax',codomain_domain2) ).
cnf(endomorphism,hypothesis,
( X1 = X3
| codomain(compose(a,b)) != domain(X1)
| compose(compose(a,b),X1) != X2
| codomain(compose(a,b)) != domain(X3)
| compose(compose(a,b),X3) != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',endomorphism) ).
cnf(codomain_of_a_equals_domain_of_b,hypothesis,
codomain(a) = domain(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain_of_a_equals_domain_of_b) ).
cnf(codomain_of_b_equals_domain_of_h,hypothesis,
codomain(b) = domain(h),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain_of_b_equals_domain_of_h) ).
cnf(star_property,axiom,
( compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3)
| codomain(X1) != domain(X2)
| codomain(X2) != domain(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT002-0.ax',star_property) ).
cnf(codomain_of_b_equals_domain_of_g,hypothesis,
codomain(b) = domain(g),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain_of_b_equals_domain_of_g) ).
cnf(prove_g_equals_h,negated_conjecture,
g != h,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_g_equals_h) ).
cnf(bh_equals_bg,hypothesis,
compose(b,h) = compose(b,g),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bh_equals_bg) ).
cnf(c_0_8,plain,
( codomain(compose(X1,X2)) = codomain(X2)
| codomain(X1) != domain(X2) ),
inference(fof_simplification,[status(thm)],[codomain_domain2]) ).
cnf(c_0_9,hypothesis,
( X1 = X3
| codomain(compose(a,b)) != domain(X1)
| compose(compose(a,b),X1) != X2
| codomain(compose(a,b)) != domain(X3)
| compose(compose(a,b),X3) != X2 ),
inference(fof_simplification,[status(thm)],[endomorphism]) ).
cnf(c_0_10,plain,
( codomain(compose(X1,X2)) = codomain(X2)
| codomain(X1) != domain(X2) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
codomain(a) = domain(b),
codomain_of_a_equals_domain_of_b ).
cnf(c_0_12,hypothesis,
( X1 = X3
| codomain(compose(a,b)) != domain(X1)
| compose(compose(a,b),X1) != X2
| codomain(compose(a,b)) != domain(X3)
| compose(compose(a,b),X3) != X2 ),
c_0_9 ).
cnf(c_0_13,hypothesis,
( codomain(compose(a,X1)) = codomain(X1)
| domain(b) != domain(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
codomain(b) = domain(h),
codomain_of_b_equals_domain_of_h ).
cnf(c_0_15,plain,
( compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3)
| codomain(X1) != domain(X2)
| codomain(X2) != domain(X3) ),
inference(fof_simplification,[status(thm)],[star_property]) ).
cnf(c_0_16,hypothesis,
( X1 = X2
| compose(compose(a,b),X1) != compose(compose(a,b),X2)
| codomain(compose(a,b)) != domain(X2)
| codomain(compose(a,b)) != domain(X1) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
codomain(compose(a,b)) = domain(h),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
( compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3)
| codomain(X1) != domain(X2)
| codomain(X2) != domain(X3) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
( X1 = X2
| compose(compose(a,b),X1) != compose(compose(a,b),X2)
| domain(h) != domain(X2)
| domain(h) != domain(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,hypothesis,
codomain(b) = domain(g),
codomain_of_b_equals_domain_of_g ).
cnf(c_0_21,negated_conjecture,
g != h,
inference(fof_simplification,[status(thm)],[prove_g_equals_h]) ).
cnf(c_0_22,hypothesis,
( compose(compose(X1,b),X2) = compose(X1,compose(b,X2))
| domain(h) != domain(X2)
| codomain(X1) != domain(b) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_23,hypothesis,
( X1 = h
| compose(compose(a,b),X1) != compose(compose(a,b),h)
| domain(h) != domain(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
domain(g) = domain(h),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_25,negated_conjecture,
g != h,
c_0_21 ).
cnf(c_0_26,hypothesis,
( compose(compose(a,b),X1) = compose(a,compose(b,X1))
| domain(h) != domain(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_27,hypothesis,
compose(compose(a,b),g) != compose(compose(a,b),h),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,hypothesis,
compose(compose(a,b),h) = compose(a,compose(b,h)),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_29,hypothesis,
compose(b,h) = compose(b,g),
bh_equals_bg ).
cnf(c_0_30,hypothesis,
compose(compose(a,b),g) != compose(a,compose(b,h)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : CAT003-2 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n016.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 300
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Sat May 18 11:34:07 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.12/0.34 Running first-order model finding
% 0.12/0.34 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Version: 3.1.0
% 0.12/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.36 # Starting sh5l with 300s (1) cores
% 0.12/0.36 # new_bool_3 with pid 9053 completed with status 0
% 0.12/0.36 # Result found by new_bool_3
% 0.12/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.36 # Search class: FHUPM-FFSS21-SFFFFFNN
% 0.12/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.12/0.36 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 9057 completed with status 0
% 0.12/0.36 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.12/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.36 # Search class: FHUPM-FFSS21-SFFFFFNN
% 0.12/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.12/0.36 # Preprocessing time : 0.001 s
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36
% 0.12/0.36 # Proof found!
% 0.12/0.36 # SZS status Unsatisfiable
% 0.12/0.36 # SZS output start CNFRefutation
% See solution above
% 0.12/0.36 # Parsed axioms : 13
% 0.12/0.36 # Removed by relevancy pruning/SinE : 0
% 0.12/0.36 # Initial clauses : 13
% 0.12/0.36 # Removed in clause preprocessing : 0
% 0.12/0.36 # Initial clauses in saturation : 13
% 0.12/0.36 # Processed clauses : 755
% 0.12/0.36 # ...of these trivial : 6
% 0.12/0.36 # ...subsumed : 527
% 0.12/0.36 # ...remaining for further processing : 221
% 0.12/0.36 # Other redundant clauses eliminated : 1
% 0.12/0.36 # Clauses deleted for lack of memory : 0
% 0.12/0.36 # Backward-subsumed : 20
% 0.12/0.36 # Backward-rewritten : 13
% 0.12/0.36 # Generated clauses : 1343
% 0.12/0.36 # ...of the previous two non-redundant : 1191
% 0.12/0.36 # ...aggressively subsumed : 0
% 0.12/0.36 # Contextual simplify-reflections : 0
% 0.12/0.36 # Paramodulations : 1296
% 0.12/0.36 # Factorizations : 0
% 0.12/0.36 # NegExts : 0
% 0.12/0.36 # Equation resolutions : 47
% 0.12/0.36 # Disequality decompositions : 0
% 0.12/0.36 # Total rewrite steps : 460
% 0.12/0.36 # ...of those cached : 411
% 0.12/0.36 # Propositional unsat checks : 0
% 0.12/0.36 # Propositional check models : 0
% 0.12/0.36 # Propositional check unsatisfiable : 0
% 0.12/0.36 # Propositional clauses : 0
% 0.12/0.36 # Propositional clauses after purity: 0
% 0.12/0.36 # Propositional unsat core size : 0
% 0.12/0.36 # Propositional preprocessing time : 0.000
% 0.12/0.36 # Propositional encoding time : 0.000
% 0.12/0.36 # Propositional solver time : 0.000
% 0.12/0.36 # Success case prop preproc time : 0.000
% 0.12/0.36 # Success case prop encoding time : 0.000
% 0.12/0.36 # Success case prop solver time : 0.000
% 0.12/0.36 # Current number of processed clauses : 174
% 0.12/0.36 # Positive orientable unit clauses : 31
% 0.12/0.36 # Positive unorientable unit clauses: 0
% 0.12/0.36 # Negative unit clauses : 2
% 0.12/0.36 # Non-unit-clauses : 141
% 0.12/0.36 # Current number of unprocessed clauses: 434
% 0.12/0.36 # ...number of literals in the above : 1125
% 0.12/0.36 # Current number of archived formulas : 0
% 0.12/0.36 # Current number of archived clauses : 46
% 0.12/0.36 # Clause-clause subsumption calls (NU) : 1980
% 0.12/0.36 # Rec. Clause-clause subsumption calls : 1978
% 0.12/0.36 # Non-unit clause-clause subsumptions : 545
% 0.12/0.36 # Unit Clause-clause subsumption calls : 4
% 0.12/0.36 # Rewrite failures with RHS unbound : 0
% 0.12/0.36 # BW rewrite match attempts : 6
% 0.12/0.36 # BW rewrite match successes : 6
% 0.12/0.36 # Condensation attempts : 0
% 0.12/0.36 # Condensation successes : 0
% 0.12/0.36 # Termbank termtop insertions : 17002
% 0.12/0.36 # Search garbage collected termcells : 22
% 0.12/0.36
% 0.12/0.36 # -------------------------------------------------
% 0.12/0.36 # User time : 0.016 s
% 0.12/0.36 # System time : 0.002 s
% 0.12/0.36 # Total time : 0.018 s
% 0.12/0.36 # Maximum resident set size: 1688 pages
% 0.12/0.36
% 0.12/0.36 # -------------------------------------------------
% 0.12/0.36 # User time : 0.017 s
% 0.12/0.36 # System time : 0.003 s
% 0.12/0.36 # Total time : 0.020 s
% 0.12/0.36 # Maximum resident set size: 1700 pages
% 0.12/0.36 % E---3.1 exiting
%------------------------------------------------------------------------------