TSTP Solution File: CAT010-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CAT010-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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 : Fri May 3 02:09:03 EDT 2024
% Result : Unsatisfiable 0.47s 1.16s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
ifeq2(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(c_51,plain,
ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(c_55,plain,
ifeq(there_exists(domain(X0)),true,there_exists(X0),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_has_elements) ).
cnf(c_57,plain,
ifeq(there_exists(compose(X0,X1)),true,there_exists(domain(X0)),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_implies_domain) ).
cnf(c_58,plain,
ifeq2(there_exists(compose(X0,X1)),true,domain(X0),codomain(X1)) = codomain(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_codomain_composition1) ).
cnf(c_60,plain,
compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_compose) ).
cnf(c_62,plain,
compose(codomain(X0),X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_codomain) ).
cnf(c_63,plain,
there_exists(compose(a,b)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_exists) ).
cnf(c_64,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).
cnf(c_119,plain,
compose(a,b) = sP0_iProver_def,
definition ).
cnf(c_120,plain,
codomain(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_121,plain,
codomain(a) = sP2_iProver_def,
definition ).
cnf(c_122,negated_conjecture,
sP1_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_64,c_121,c_119,c_120]) ).
cnf(c_228,plain,
compose(sP2_iProver_def,a) = a,
inference(superposition,[status(thm)],[c_121,c_62]) ).
cnf(c_232,plain,
there_exists(sP0_iProver_def) = true,
inference(light_normalisation,[status(thm)],[c_63,c_119]) ).
cnf(c_252,plain,
compose(sP2_iProver_def,compose(a,X0)) = compose(a,X0),
inference(superposition,[status(thm)],[c_228,c_60]) ).
cnf(c_286,plain,
ifeq(there_exists(sP0_iProver_def),true,there_exists(domain(a)),true) = true,
inference(superposition,[status(thm)],[c_119,c_57]) ).
cnf(c_292,plain,
ifeq(true,true,there_exists(domain(a)),true) = true,
inference(light_normalisation,[status(thm)],[c_286,c_232]) ).
cnf(c_301,plain,
ifeq2(there_exists(a),true,domain(sP2_iProver_def),codomain(a)) = codomain(a),
inference(superposition,[status(thm)],[c_228,c_58]) ).
cnf(c_308,plain,
ifeq2(there_exists(a),true,domain(sP2_iProver_def),sP2_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_301,c_121]) ).
cnf(c_483,plain,
compose(sP2_iProver_def,sP0_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_119,c_252]) ).
cnf(c_509,plain,
ifeq2(there_exists(sP0_iProver_def),true,domain(sP2_iProver_def),codomain(sP0_iProver_def)) = codomain(sP0_iProver_def),
inference(superposition,[status(thm)],[c_483,c_58]) ).
cnf(c_513,plain,
ifeq2(true,true,domain(sP2_iProver_def),sP1_iProver_def) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_509,c_120,c_232]) ).
cnf(c_521,plain,
domain(sP2_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_513,c_50]) ).
cnf(c_687,plain,
there_exists(domain(a)) = true,
inference(demodulation,[status(thm)],[c_292,c_51]) ).
cnf(c_694,plain,
ifeq(true,true,there_exists(a),true) = true,
inference(superposition,[status(thm)],[c_687,c_55]) ).
cnf(c_745,plain,
there_exists(a) = true,
inference(demodulation,[status(thm)],[c_694,c_51]) ).
cnf(c_929,plain,
ifeq2(true,true,sP1_iProver_def,sP2_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_308,c_521,c_745]) ).
cnf(c_930,plain,
sP1_iProver_def = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_929,c_50]) ).
cnf(c_931,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_930,c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT010-10 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 21:12:12 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.16 % SZS status Started for theBenchmark.p
% 0.47/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.16
% 0.47/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.16
% 0.47/1.16 ------ iProver source info
% 0.47/1.16
% 0.47/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.16 git: non_committed_changes: false
% 0.47/1.16
% 0.47/1.16 ------ Parsing...successful
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.47/1.16 ------ Proving...
% 0.47/1.16 ------ Problem Properties
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 clauses 19
% 0.47/1.16 conjectures 1
% 0.47/1.16 EPR 1
% 0.47/1.16 Horn 19
% 0.47/1.16 unary 19
% 0.47/1.16 binary 0
% 0.47/1.16 lits 19
% 0.47/1.16 lits eq 19
% 0.47/1.16 fd_pure 0
% 0.47/1.16 fd_pseudo 0
% 0.47/1.16 fd_cond 0
% 0.47/1.16 fd_pseudo_cond 0
% 0.47/1.16 AC symbols 0
% 0.47/1.16
% 0.47/1.16 ------ Input Options Time Limit: Unbounded
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------
% 0.47/1.16 Current options:
% 0.47/1.16 ------
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------ Proving...
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.16
% 0.47/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.16
% 0.47/1.16
%------------------------------------------------------------------------------