TSTP Solution File: PLA031-1.003 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PLA031-1.003 : TPTP v8.1.2. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:53:54 EDT 2024
% Result : Unsatisfiable 106.64s 15.26s
% Output : CNFRefutation 106.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of clauses : 49 ( 28 unt; 0 nHn; 49 RR)
% Number of literals : 76 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-8 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 138 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ s(X0,X1,X2,X3,X4,X5,X0,X6)
| s(truck1,X1,X2,X3,X4,X5,X0,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load1) ).
cnf(c_50,plain,
( ~ s(truck1,X0,X1,X2,X3,X4,X5,X6)
| s(X5,X0,X1,X2,X3,X4,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load2) ).
cnf(c_57,plain,
( ~ s(X0,X1,X2,X3,X4,X5,X2,X6)
| s(X0,X1,truck1,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load9) ).
cnf(c_58,plain,
( ~ s(X0,X1,truck1,X2,X3,X4,X5,X6)
| s(X0,X1,X5,X2,X3,X4,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load10) ).
cnf(c_61,plain,
( ~ s(X0,X1,X2,X3,X4,X5,X3,X6)
| s(X0,X1,X2,truck1,X4,X5,X3,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load13) ).
cnf(c_62,plain,
( ~ s(X0,X1,X2,truck1,X3,X4,X5,X6)
| s(X0,X1,X2,X5,X3,X4,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load14) ).
cnf(c_69,plain,
( ~ s(X0,X1,X2,X3,X4,X5,X5,X6)
| ~ neq(X4,truck1)
| s(X0,X1,X2,X3,X4,truck1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board5) ).
cnf(c_75,plain,
( ~ s(X0,X1,X2,X3,X4,truck1,X5,X6)
| ~ link(X5,X7)
| s(X0,X1,X2,X3,X4,truck1,X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive3) ).
cnf(c_77,plain,
( ~ s(X0,X1,X2,X3,X4,X5,X6,X7)
| ~ path(X4,X8)
| s(X0,X1,X2,X3,X8,X5,X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk1) ).
cnf(c_78,plain,
( ~ s(X0,X1,X2,X3,X4,X5,X6,X7)
| ~ path(X5,X8)
| s(X0,X1,X2,X3,X4,X8,X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk2) ).
cnf(c_103,plain,
neq(s1,truck1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq25) ).
cnf(c_143,plain,
path(s0,p0_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map1) ).
cnf(c_146,plain,
path(p0_1,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map4) ).
cnf(c_148,plain,
path(p1_2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).
cnf(c_149,plain,
path(s2,p1_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).
cnf(c_155,plain,
link(s1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map13) ).
cnf(c_157,plain,
link(s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map15) ).
cnf(c_158,plain,
link(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map16) ).
cnf(c_159,plain,
s(s1,s2,s2,s0,s2,s0,s1,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(c_160,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X0,s0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_175,plain,
s(truck1,s2,s2,s0,s2,s0,s1,s1),
inference(resolution,[status(thm)],[c_49,c_159]) ).
cnf(c_202,plain,
( ~ s(X0,X1,X2,X3,s1,X4,X4,X5)
| s(X0,X1,X2,X3,s1,truck1,X4,X5) ),
inference(resolution,[status(thm)],[c_69,c_103]) ).
cnf(c_237,plain,
( ~ s(X0,X1,X2,X3,X4,truck1,s1,X5)
| s(X0,X1,X2,X3,X4,truck1,s2,X5) ),
inference(resolution,[status(thm)],[c_75,c_155]) ).
cnf(c_239,plain,
( ~ s(X0,X1,X2,X3,X4,truck1,s2,X5)
| s(X0,X1,X2,X3,X4,truck1,s0,X5) ),
inference(resolution,[status(thm)],[c_75,c_157]) ).
cnf(c_240,plain,
( ~ s(X0,X1,X2,X3,X4,truck1,s0,X5)
| s(X0,X1,X2,X3,X4,truck1,s2,X5) ),
inference(resolution,[status(thm)],[c_75,c_158]) ).
cnf(c_259,plain,
( ~ s(X0,X1,X2,X3,p1_2,X4,X5,X6)
| s(X0,X1,X2,X3,s1,X4,X5,X6) ),
inference(resolution,[status(thm)],[c_77,c_148]) ).
cnf(c_261,plain,
( ~ s(X0,X1,X2,X3,s2,X4,X5,X6)
| s(X0,X1,X2,X3,p1_2,X4,X5,X6) ),
inference(resolution,[status(thm)],[c_77,c_149]) ).
cnf(c_273,plain,
( ~ s(X0,X1,X2,X3,X4,s0,X5,X6)
| s(X0,X1,X2,X3,X4,p0_1,X5,X6) ),
inference(resolution,[status(thm)],[c_78,c_143]) ).
cnf(c_279,plain,
( ~ s(X0,X1,X2,X3,X4,p0_1,X5,X6)
| s(X0,X1,X2,X3,X4,s1,X5,X6) ),
inference(resolution,[status(thm)],[c_78,c_146]) ).
cnf(c_298,plain,
s(truck1,s2,s2,s0,p1_2,s0,s1,s1),
inference(resolution,[status(thm)],[c_261,c_175]) ).
cnf(c_309,plain,
s(truck1,s2,s2,s0,s1,s0,s1,s1),
inference(resolution,[status(thm)],[c_298,c_259]) ).
cnf(c_353,plain,
s(truck1,s2,s2,s0,s1,p0_1,s1,s1),
inference(resolution,[status(thm)],[c_273,c_309]) ).
cnf(c_518,plain,
s(truck1,s2,s2,s0,s1,s1,s1,s1),
inference(resolution,[status(thm)],[c_353,c_279]) ).
cnf(c_1026,plain,
s(truck1,s2,s2,s0,s1,truck1,s1,s1),
inference(resolution,[status(thm)],[c_518,c_202]) ).
cnf(c_2064,plain,
s(truck1,s2,s2,s0,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_1026,c_237]) ).
cnf(c_4479,plain,
s(s2,s2,s2,s0,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_2064,c_50]) ).
cnf(c_10454,plain,
s(s2,s2,truck1,s0,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_4479,c_57]) ).
cnf(c_23904,plain,
s(s2,s2,truck1,s0,s1,truck1,s0,s1),
inference(resolution,[status(thm)],[c_10454,c_239]) ).
cnf(c_49651,plain,
s(s2,s2,truck1,truck1,s1,truck1,s0,s1),
inference(resolution,[status(thm)],[c_23904,c_61]) ).
cnf(c_95786,plain,
s(s2,s2,truck1,truck1,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_49651,c_240]) ).
cnf(c_198334,plain,
s(s2,s2,truck1,s2,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_95786,c_62]) ).
cnf(c_267324,plain,
( ~ s(s2,s2,truck1,s2,s1,X0,s0,X1)
| s(s2,s2,s0,s2,s1,X0,s0,X1) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_267326,plain,
~ s(s2,s2,truck1,s2,s1,X0,s0,X1),
inference(global_subsumption_just,[status(thm)],[c_267324,c_160,c_267324]) ).
cnf(c_278077,plain,
~ s(s2,s2,truck1,s2,s1,truck1,s0,X0),
inference(instantiation,[status(thm)],[c_267326]) ).
cnf(c_291613,plain,
( ~ s(s2,s2,truck1,s2,s1,truck1,X0,X1)
| ~ link(X0,s0)
| s(s2,s2,truck1,s2,s1,truck1,s0,X1) ),
inference(instantiation,[status(thm)],[c_75]) ).
cnf(c_291961,plain,
( ~ s(s2,s2,truck1,s2,s1,truck1,s2,X0)
| ~ link(s2,s0)
| s(s2,s2,truck1,s2,s1,truck1,s0,X0) ),
inference(instantiation,[status(thm)],[c_291613]) ).
cnf(c_291963,plain,
~ s(s2,s2,truck1,s2,s1,truck1,s2,X0),
inference(global_subsumption_just,[status(thm)],[c_291961,c_157,c_278077,c_291961]) ).
cnf(c_293096,plain,
~ s(s2,s2,truck1,s2,s1,truck1,s2,s1),
inference(instantiation,[status(thm)],[c_291963]) ).
cnf(c_293097,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_293096,c_198334]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PLA031-1.003 : TPTP v8.1.2. Released v3.5.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n010.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:18:04 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
% 106.64/15.26 % SZS status Started for theBenchmark.p
% 106.64/15.26 % SZS status Unsatisfiable for theBenchmark.p
% 106.64/15.26
% 106.64/15.26 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 106.64/15.26
% 106.64/15.26 ------ iProver source info
% 106.64/15.26
% 106.64/15.26 git: date: 2024-05-02 19:28:25 +0000
% 106.64/15.26 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 106.64/15.26 git: non_committed_changes: false
% 106.64/15.26
% 106.64/15.26 ------ Parsing...successful
% 106.64/15.26
% 106.64/15.26 ------ preprocesses with Option_epr_horn
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26 ------ Preprocessing... sf_s rm: 50 0s sf_e sf_s rm: 0 0s sf_e
% 106.64/15.26
% 106.64/15.26 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 106.64/15.26 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 106.64/15.26 ------ Proving...
% 106.64/15.26 ------ Problem Properties
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26 clauses 62
% 106.64/15.26 conjectures 1
% 106.64/15.26 EPR 62
% 106.64/15.26 Horn 62
% 106.64/15.26 unary 32
% 106.64/15.26 binary 20
% 106.64/15.26 lits 102
% 106.64/15.26 lits eq 0
% 106.64/15.26 fd_pure 0
% 106.64/15.26 fd_pseudo 0
% 106.64/15.26 fd_cond 0
% 106.64/15.26 fd_pseudo_cond 0
% 106.64/15.26 AC symbols 0
% 106.64/15.26
% 106.64/15.26 ------ Schedule EPR Horn non eq is on
% 106.64/15.26
% 106.64/15.26 ------ no equalities: superposition off
% 106.64/15.26
% 106.64/15.26 ------ Option_epr_horn Time Limit: Unbounded
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26 ------
% 106.64/15.26 Current options:
% 106.64/15.26 ------
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26 ------ Proving...
% 106.64/15.26
% 106.64/15.26
% 106.64/15.26 % SZS status Unsatisfiable for theBenchmark.p
% 106.64/15.26
% 106.64/15.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 106.64/15.26
% 106.64/15.26
%------------------------------------------------------------------------------