TSTP Solution File: PLA031-1.003 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PLA031-1.003 : TPTP v8.1.2. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Thu Aug 31 13:01:44 EDT 2023
% Result : Unsatisfiable 72.91s 10.77s
% Output : CNFRefutation 72.91s
% 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_174,plain,
s(truck1,s2,s2,s0,s2,s0,s1,s1),
inference(resolution,[status(thm)],[c_49,c_159]) ).
cnf(c_201,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_236,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_238,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_239,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_258,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_260,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_272,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_278,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_297,plain,
s(truck1,s2,s2,s0,p1_2,s0,s1,s1),
inference(resolution,[status(thm)],[c_260,c_174]) ).
cnf(c_308,plain,
s(truck1,s2,s2,s0,s1,s0,s1,s1),
inference(resolution,[status(thm)],[c_297,c_258]) ).
cnf(c_352,plain,
s(truck1,s2,s2,s0,s1,p0_1,s1,s1),
inference(resolution,[status(thm)],[c_272,c_308]) ).
cnf(c_517,plain,
s(truck1,s2,s2,s0,s1,s1,s1,s1),
inference(resolution,[status(thm)],[c_352,c_278]) ).
cnf(c_1025,plain,
s(truck1,s2,s2,s0,s1,truck1,s1,s1),
inference(resolution,[status(thm)],[c_517,c_201]) ).
cnf(c_2063,plain,
s(truck1,s2,s2,s0,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_1025,c_236]) ).
cnf(c_4478,plain,
s(s2,s2,s2,s0,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_2063,c_50]) ).
cnf(c_10453,plain,
s(s2,s2,truck1,s0,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_4478,c_57]) ).
cnf(c_23903,plain,
s(s2,s2,truck1,s0,s1,truck1,s0,s1),
inference(resolution,[status(thm)],[c_10453,c_238]) ).
cnf(c_49650,plain,
s(s2,s2,truck1,truck1,s1,truck1,s0,s1),
inference(resolution,[status(thm)],[c_23903,c_61]) ).
cnf(c_95785,plain,
s(s2,s2,truck1,truck1,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_49650,c_239]) ).
cnf(c_198333,plain,
s(s2,s2,truck1,s2,s1,truck1,s2,s1),
inference(resolution,[status(thm)],[c_95785,c_62]) ).
cnf(c_267323,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_267325,plain,
~ s(s2,s2,truck1,s2,s1,X0,s0,X1),
inference(global_subsumption_just,[status(thm)],[c_267323,c_160,c_267323]) ).
cnf(c_278076,plain,
~ s(s2,s2,truck1,s2,s1,truck1,s0,X0),
inference(instantiation,[status(thm)],[c_267325]) ).
cnf(c_291612,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_291960,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_291612]) ).
cnf(c_291962,plain,
~ s(s2,s2,truck1,s2,s1,truck1,s2,X0),
inference(global_subsumption_just,[status(thm)],[c_291960,c_157,c_278076,c_291960]) ).
cnf(c_293095,plain,
~ s(s2,s2,truck1,s2,s1,truck1,s2,s1),
inference(instantiation,[status(thm)],[c_291962]) ).
cnf(c_293096,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_293095,c_198333]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA031-1.003 : TPTP v8.1.2. Released v3.5.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 06:08:41 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.45 Running first-order theorem proving
% 0.20/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 72.91/10.77 % SZS status Started for theBenchmark.p
% 72.91/10.77 % SZS status Unsatisfiable for theBenchmark.p
% 72.91/10.77
% 72.91/10.77 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 72.91/10.77
% 72.91/10.77 ------ iProver source info
% 72.91/10.77
% 72.91/10.77 git: date: 2023-05-31 18:12:56 +0000
% 72.91/10.77 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 72.91/10.77 git: non_committed_changes: false
% 72.91/10.77 git: last_make_outside_of_git: false
% 72.91/10.77
% 72.91/10.77 ------ Parsing...successful
% 72.91/10.77
% 72.91/10.77 ------ preprocesses with Option_epr_horn
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77 ------ Preprocessing... sf_s rm: 50 0s sf_e sf_s rm: 0 0s sf_e
% 72.91/10.77
% 72.91/10.77 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 72.91/10.77 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 72.91/10.77 ------ Proving...
% 72.91/10.77 ------ Problem Properties
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77 clauses 62
% 72.91/10.77 conjectures 1
% 72.91/10.77 EPR 62
% 72.91/10.77 Horn 62
% 72.91/10.77 unary 32
% 72.91/10.77 binary 20
% 72.91/10.77 lits 102
% 72.91/10.77 lits eq 0
% 72.91/10.77 fd_pure 0
% 72.91/10.77 fd_pseudo 0
% 72.91/10.77 fd_cond 0
% 72.91/10.77 fd_pseudo_cond 0
% 72.91/10.77 AC symbols 0
% 72.91/10.77
% 72.91/10.77 ------ Schedule EPR Horn non eq is on
% 72.91/10.77
% 72.91/10.77 ------ no equalities: superposition off
% 72.91/10.77
% 72.91/10.77 ------ Option_epr_horn Time Limit: Unbounded
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77 ------
% 72.91/10.77 Current options:
% 72.91/10.77 ------
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77 ------ Proving...
% 72.91/10.77
% 72.91/10.77
% 72.91/10.77 % SZS status Unsatisfiable for theBenchmark.p
% 72.91/10.77
% 72.91/10.77 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 72.91/10.78
% 72.91/10.78
%------------------------------------------------------------------------------