TSTP Solution File: CAT010-10 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CAT010-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:32 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 10 RR)
% Number of literals : 27 ( 26 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 35 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
ifeq2(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2)) = codomain(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition1) ).
cnf(ab_exists,hypothesis,
there_exists(compose(a,b)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).
cnf(ifeq_axiom_001,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(associativity_of_compose,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_compose) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_codomain) ).
cnf(composition_implies_domain,axiom,
ifeq(there_exists(compose(X1,X2)),true,there_exists(domain(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_implies_domain) ).
cnf(ifeq_axiom_002,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(domain_has_elements,axiom,
ifeq(there_exists(domain(X1)),true,there_exists(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_has_elements) ).
cnf(prove_codomain_of_ab_equals_codomain_of_a,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).
cnf(c_0_9,axiom,
ifeq2(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2)) = codomain(X2),
domain_codomain_composition1 ).
cnf(c_0_10,hypothesis,
there_exists(compose(a,b)) = true,
ab_exists ).
cnf(c_0_11,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_12,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_13,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_14,axiom,
ifeq(there_exists(compose(X1,X2)),true,there_exists(domain(X1)),true) = true,
composition_implies_domain ).
cnf(c_0_15,hypothesis,
domain(a) = codomain(b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_16,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_17,plain,
compose(codomain(X1),compose(X1,X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
ifeq(there_exists(domain(X1)),true,there_exists(X1),true) = true,
domain_has_elements ).
cnf(c_0_19,hypothesis,
there_exists(codomain(b)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
ifeq2(there_exists(compose(X1,X2)),true,domain(codomain(X1)),codomain(compose(X1,X2))) = codomain(compose(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
inference(fof_simplification,[status(thm)],[prove_codomain_of_ab_equals_codomain_of_a]) ).
cnf(c_0_22,plain,
ifeq2(there_exists(X1),true,domain(codomain(X1)),codomain(X1)) = codomain(X1),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_23,hypothesis,
there_exists(a) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_19]),c_0_16]) ).
cnf(c_0_24,hypothesis,
domain(codomain(a)) = codomain(compose(a,b)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_11]) ).
cnf(c_0_25,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
c_0_21 ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_11]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CAT010-10 : TPTP v8.2.0. Released v7.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 11:45:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2547 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FUUPM-FFSF32-MFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.19/0.49 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.49 # G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with pid 2551 completed with status 0
% 0.19/0.49 # Result found by G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FUUPM-FFSF32-MFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 16
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 16
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 16
% 0.19/0.49 # Processed clauses : 134
% 0.19/0.49 # ...of these trivial : 52
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 82
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 7
% 0.19/0.49 # Generated clauses : 1010
% 0.19/0.49 # ...of the previous two non-redundant : 684
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 1010
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 1273
% 0.19/0.49 # ...of those cached : 1092
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 75
% 0.19/0.49 # Positive orientable unit clauses : 74
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 0
% 0.19/0.49 # Current number of unprocessed clauses: 551
% 0.19/0.49 # ...number of literals in the above : 551
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 7
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 107
% 0.19/0.49 # BW rewrite match successes : 6
% 0.19/0.49 # Condensation attempts : 134
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 13260
% 0.19/0.49 # Search garbage collected termcells : 2
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.012 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.015 s
% 0.19/0.49 # Maximum resident set size: 1564 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.058 s
% 0.19/0.49 # System time : 0.014 s
% 0.19/0.49 # Total time : 0.071 s
% 0.19/0.49 # Maximum resident set size: 1688 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------