TSTP Solution File: SYN195-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN195-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 03:29:35 EDT 2024
% Result : Unsatisfiable 2.58s 1.20s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of clauses : 38 ( 8 unt; 1 nHn; 37 RR)
% Number of literals : 89 ( 0 equ; 53 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 3 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 46 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ r5(d,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_58,plain,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(c_59,plain,
p0(b,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_10) ).
cnf(c_68,plain,
m0(X0,d,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(c_81,plain,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(c_86,plain,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(c_90,plain,
( ~ m0(X0,X1,X2)
| ~ p0(X2,X1)
| ~ r0(X3)
| l1(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).
cnf(c_155,plain,
( ~ k0(X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_068) ).
cnf(c_179,plain,
( ~ n0(X0,X1)
| ~ p0(X2,X3)
| q1(X3,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_092) ).
cnf(c_200,plain,
( ~ m1(X0,X1,X1)
| ~ r0(X2)
| q1(X0,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_113) ).
cnf(c_224,plain,
( ~ p1(X0,X1,X2)
| n2(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(c_228,plain,
( ~ q1(X0,a,X0)
| p2(X0,a,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_141) ).
cnf(c_327,plain,
( ~ p2(X0,X1,X2)
| n3(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
cnf(c_331,plain,
( ~ n2(X0)
| p3(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(c_386,plain,
( ~ p3(X0,X1,X2)
| ~ l1(X3,X1)
| s4(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_299) ).
cnf(c_414,plain,
( ~ n3(X0)
| ~ s4(X1)
| ~ k0(b)
| r5(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_327) ).
cnf(c_420,plain,
m0(b,d,b),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_436,plain,
( ~ n2(b)
| p3(b,b,b) ),
inference(instantiation,[status(thm)],[c_331]) ).
cnf(c_442,plain,
( ~ p1(b,b,b)
| n2(b) ),
inference(instantiation,[status(thm)],[c_224]) ).
cnf(c_444,plain,
( ~ k0(b)
| p1(b,b,b) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_649,plain,
( ~ s4(X1)
| ~ n3(X0)
| r5(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_414,c_81,c_414]) ).
cnf(c_650,plain,
( ~ n3(X0)
| ~ s4(X1)
| r5(X1,X0) ),
inference(renaming,[status(thm)],[c_649]) ).
cnf(c_804,plain,
( ~ r0(X0)
| ~ sP54_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP54_iProver_def])],[c_200]) ).
cnf(c_847,plain,
( ~ m0(X0,X1,X2)
| l1(X1,X0)
| ~ p0(X2,X1)
| ~ sP80_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP80_iProver_def])],[c_90]) ).
cnf(c_848,plain,
( sP54_iProver_def
| sP80_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_90]) ).
cnf(c_857,plain,
( ~ r0(b)
| ~ sP54_iProver_def ),
inference(instantiation,[status(thm)],[c_804]) ).
cnf(c_1182,plain,
( ~ p0(X0,X1)
| ~ n0(b,a)
| q1(X1,a,X1) ),
inference(instantiation,[status(thm)],[c_179]) ).
cnf(c_1215,plain,
( ~ m0(X0,d,X1)
| ~ p0(X1,d)
| ~ sP80_iProver_def
| l1(d,X0) ),
inference(instantiation,[status(thm)],[c_847]) ).
cnf(c_1216,plain,
( ~ m0(b,d,b)
| ~ p0(b,d)
| ~ sP80_iProver_def
| l1(d,b) ),
inference(instantiation,[status(thm)],[c_1215]) ).
cnf(c_1693,plain,
( ~ p0(X0,d)
| ~ n0(b,a)
| q1(d,a,d) ),
inference(instantiation,[status(thm)],[c_1182]) ).
cnf(c_1695,plain,
( ~ n0(b,a)
| ~ p0(b,d)
| q1(d,a,d) ),
inference(instantiation,[status(thm)],[c_1693]) ).
cnf(c_1729,plain,
( ~ n3(d)
| ~ s4(d)
| r5(d,d) ),
inference(instantiation,[status(thm)],[c_650]) ).
cnf(c_1870,plain,
( ~ p2(X0,X1,d)
| n3(d) ),
inference(instantiation,[status(thm)],[c_327]) ).
cnf(c_2354,plain,
( ~ p2(d,a,d)
| n3(d) ),
inference(instantiation,[status(thm)],[c_1870]) ).
cnf(c_2355,plain,
( ~ q1(d,a,d)
| p2(d,a,d) ),
inference(instantiation,[status(thm)],[c_228]) ).
cnf(c_2949,plain,
( ~ p3(X0,X1,X2)
| ~ l1(d,X1)
| s4(d) ),
inference(instantiation,[status(thm)],[c_386]) ).
cnf(c_2950,plain,
( ~ p3(b,b,b)
| ~ l1(d,b)
| s4(d) ),
inference(instantiation,[status(thm)],[c_2949]) ).
cnf(c_2951,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2950,c_2355,c_2354,c_1729,c_1695,c_1216,c_857,c_848,c_444,c_442,c_436,c_420,c_49,c_59,c_86,c_58,c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN195-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n006.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 20:47:49 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.58/1.20 % SZS status Started for theBenchmark.p
% 2.58/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.58/1.20
% 2.58/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.58/1.20
% 2.58/1.20 ------ iProver source info
% 2.58/1.20
% 2.58/1.20 git: date: 2024-05-02 19:28:25 +0000
% 2.58/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.58/1.20 git: non_committed_changes: false
% 2.58/1.20
% 2.58/1.20 ------ Parsing...successful
% 2.58/1.20
% 2.58/1.20 ------ preprocesses with Option_epr_horn
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20 ------ Preprocessing... sf_s rm: 64 0s sf_e sf_s rm: 0 0s sf_e
% 2.58/1.20
% 2.58/1.20 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 2.58/1.20 gs_s sp: 94 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.58/1.20 ------ Proving...
% 2.58/1.20 ------ Problem Properties
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20 clauses 359
% 2.58/1.20 conjectures 1
% 2.58/1.20 EPR 359
% 2.58/1.20 Horn 313
% 2.58/1.20 unary 51
% 2.58/1.20 binary 143
% 2.58/1.20 lits 893
% 2.58/1.20 lits eq 0
% 2.58/1.20 fd_pure 0
% 2.58/1.20 fd_pseudo 0
% 2.58/1.20 fd_cond 0
% 2.58/1.20 fd_pseudo_cond 0
% 2.58/1.20 AC symbols 0
% 2.58/1.20
% 2.58/1.20 ------ Schedule EPR non Horn non eq is on
% 2.58/1.20
% 2.58/1.20 ------ no equalities: superposition off
% 2.58/1.20
% 2.58/1.20 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20 ------
% 2.58/1.20 Current options:
% 2.58/1.20 ------
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20 ------ Proving...
% 2.58/1.20
% 2.58/1.20
% 2.58/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.58/1.20
% 2.58/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.58/1.20
% 2.58/1.20
%------------------------------------------------------------------------------