TSTP Solution File: CAT010-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CAT010-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 Jun 24 04:41:36 EDT 2024
% Result : Unsatisfiable 2.18s 1.02s
% Output : CNFRefutation 2.18s
% 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_230,plain,
there_exists(sP0_iProver_def) = true,
inference(light_normalisation,[status(thm)],[c_63,c_119]) ).
cnf(c_254,plain,
compose(sP2_iProver_def,compose(a,X0)) = compose(a,X0),
inference(superposition,[status(thm)],[c_228,c_60]) ).
cnf(c_268,plain,
ifeq(there_exists(sP0_iProver_def),true,there_exists(domain(a)),true) = true,
inference(superposition,[status(thm)],[c_119,c_57]) ).
cnf(c_272,plain,
ifeq(true,true,there_exists(domain(a)),true) = true,
inference(light_normalisation,[status(thm)],[c_268,c_230]) ).
cnf(c_280,plain,
ifeq2(there_exists(a),true,domain(sP2_iProver_def),codomain(a)) = codomain(a),
inference(superposition,[status(thm)],[c_228,c_58]) ).
cnf(c_285,plain,
ifeq2(there_exists(a),true,domain(sP2_iProver_def),sP2_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_280,c_121]) ).
cnf(c_347,plain,
compose(sP2_iProver_def,sP0_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_119,c_254]) ).
cnf(c_359,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_347,c_58]) ).
cnf(c_363,plain,
ifeq2(true,true,domain(sP2_iProver_def),sP1_iProver_def) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_359,c_120,c_230]) ).
cnf(c_365,plain,
domain(sP2_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_50,c_363]) ).
cnf(c_408,plain,
there_exists(domain(a)) = true,
inference(superposition,[status(thm)],[c_51,c_272]) ).
cnf(c_417,plain,
ifeq(true,true,there_exists(a),true) = true,
inference(superposition,[status(thm)],[c_408,c_55]) ).
cnf(c_421,plain,
there_exists(a) = true,
inference(superposition,[status(thm)],[c_51,c_417]) ).
cnf(c_432,plain,
ifeq2(true,true,sP1_iProver_def,sP2_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_285,c_365,c_421]) ).
cnf(c_433,plain,
sP1_iProver_def = sP2_iProver_def,
inference(superposition,[status(thm)],[c_50,c_432]) ).
cnf(c_435,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_433,c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : CAT010-10 : TPTP v8.2.0. Released v7.3.0.
% 0.08/0.09 % Command : run_iprover %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Tue Jun 18 12:39:39 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.12/0.37 Running UEQ theorem proving
% 0.12/0.37 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.18/1.02 % SZS status Started for theBenchmark.p
% 2.18/1.02 % SZS status Unsatisfiable for theBenchmark.p
% 2.18/1.02
% 2.18/1.02 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.18/1.02
% 2.18/1.02 ------ iProver source info
% 2.18/1.02
% 2.18/1.02 git: date: 2024-06-12 09:56:46 +0000
% 2.18/1.02 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.18/1.02 git: non_committed_changes: false
% 2.18/1.02
% 2.18/1.02 ------ Parsing...successful
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.18/1.02
% 2.18/1.02 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.18/1.02
% 2.18/1.02 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.18/1.02 ------ Proving...
% 2.18/1.02 ------ Problem Properties
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02 clauses 19
% 2.18/1.02 conjectures 1
% 2.18/1.02 EPR 1
% 2.18/1.02 Horn 19
% 2.18/1.02 unary 19
% 2.18/1.02 binary 0
% 2.18/1.02 lits 19
% 2.18/1.02 lits eq 19
% 2.18/1.02 fd_pure 0
% 2.18/1.02 fd_pseudo 0
% 2.18/1.02 fd_cond 0
% 2.18/1.02 fd_pseudo_cond 0
% 2.18/1.02 AC symbols 0
% 2.18/1.02
% 2.18/1.02 ------ Input Options Time Limit: Unbounded
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02 ------
% 2.18/1.02 Current options:
% 2.18/1.02 ------
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02 ------ Proving...
% 2.18/1.02
% 2.18/1.02
% 2.18/1.02 % SZS status Unsatisfiable for theBenchmark.p
% 2.18/1.02
% 2.18/1.02 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.18/1.02
% 2.18/1.02
%------------------------------------------------------------------------------