TSTP Solution File: MSC002-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MSC002-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 09:25:57 EDT 2023
% Result : Unsatisfiable 1.36s 1.22s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 4 unt; 1 nHn; 20 RR)
% Number of literals : 50 ( 0 equ; 34 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
at(something,here,now),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_is_here_now) ).
cnf(c_50,plain,
~ held(X0,let_go(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cant_hold_and_let_go) ).
cnf(c_51,plain,
( ~ at(X0,here,X1)
| red(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everything_is_red) ).
cnf(c_52,plain,
( ~ at(X0,X1,X2)
| at(X0,X1,let_go(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',situation_let_go) ).
cnf(c_53,plain,
( ~ at(X0,X1,X2)
| at(X0,X1,pick_up(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',situation_pick_up) ).
cnf(c_54,plain,
( ~ at(X0,X1,X2)
| grabbed(X0,pick_up(go(X1,let_go(X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',can_grab_if_previously_let_go) ).
cnf(c_55,plain,
( ~ put(X0,there,X1)
| ~ red(X0)
| answer(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',answer_if_red_and_put_there) ).
cnf(c_56,plain,
( ~ at(X0,X1,X2)
| ~ grabbed(X0,X2)
| put(X0,X3,go(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(c_57,plain,
( ~ at(X0,X1,X2)
| at(X0,X1,go(X3,X2))
| held(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thing_either_held_or_went_there) ).
cnf(c_58,negated_conjecture,
~ answer(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_an_answer_situation) ).
cnf(c_70,plain,
( ~ put(X0,there,X1)
| ~ red(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_55,c_58]) ).
cnf(c_108,plain,
( ~ at(X0,X1,let_go(X2))
| at(X0,X1,go(X3,let_go(X2))) ),
inference(resolution,[status(thm)],[c_50,c_57]) ).
cnf(c_118,plain,
( ~ at(X0,here,X1)
| ~ put(X0,there,X2) ),
inference(resolution,[status(thm)],[c_51,c_70]) ).
cnf(c_142,plain,
( ~ at(X0,X1,X2)
| ~ at(X0,here,X3)
| ~ grabbed(X0,X2) ),
inference(resolution,[status(thm)],[c_56,c_118]) ).
cnf(c_156,plain,
( ~ at(X0,X1,pick_up(go(X2,let_go(X3))))
| ~ at(X0,X2,X3)
| ~ at(X0,here,X4) ),
inference(resolution,[status(thm)],[c_54,c_142]) ).
cnf(c_190,plain,
( ~ at(something,here,now)
| at(something,here,let_go(now)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_192,plain,
( ~ at(something,X0,pick_up(go(X1,let_go(X2))))
| ~ at(something,X1,X2)
| ~ at(something,here,now) ),
inference(instantiation,[status(thm)],[c_156]) ).
cnf(c_196,plain,
( ~ at(something,here,let_go(now))
| at(something,here,go(X0,let_go(now))) ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_197,plain,
( ~ at(something,here,let_go(now))
| at(something,here,go(here,let_go(now))) ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_204,plain,
( ~ at(something,X0,pick_up(go(here,let_go(now))))
| ~ at(something,here,now) ),
inference(instantiation,[status(thm)],[c_192]) ).
cnf(c_205,plain,
( ~ at(something,here,pick_up(go(here,let_go(now))))
| ~ at(something,here,now) ),
inference(instantiation,[status(thm)],[c_204]) ).
cnf(c_319,plain,
( ~ at(something,here,go(X0,let_go(now)))
| at(something,here,pick_up(go(X0,let_go(now)))) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_322,plain,
( ~ at(something,here,go(here,let_go(now)))
| at(something,here,pick_up(go(here,let_go(now)))) ),
inference(instantiation,[status(thm)],[c_319]) ).
cnf(c_323,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_322,c_205,c_197,c_190,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MSC002-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 24 13:54:32 EDT 2023
% 0.20/0.34 % 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.36/1.22 % SZS status Started for theBenchmark.p
% 1.36/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 1.36/1.22
% 1.36/1.22 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.36/1.22
% 1.36/1.22 ------ iProver source info
% 1.36/1.22
% 1.36/1.22 git: date: 2023-05-31 18:12:56 +0000
% 1.36/1.22 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.36/1.22 git: non_committed_changes: false
% 1.36/1.22 git: last_make_outside_of_git: false
% 1.36/1.22
% 1.36/1.22 ------ Parsing...successful
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.36/1.22
% 1.36/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.36/1.22 ------ Proving...
% 1.36/1.22 ------ Problem Properties
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22 clauses 5
% 1.36/1.22 conjectures 0
% 1.36/1.22 EPR 1
% 1.36/1.22 Horn 5
% 1.36/1.22 unary 1
% 1.36/1.22 binary 3
% 1.36/1.22 lits 10
% 1.36/1.22 lits eq 0
% 1.36/1.22 fd_pure 0
% 1.36/1.22 fd_pseudo 0
% 1.36/1.22 fd_cond 0
% 1.36/1.22 fd_pseudo_cond 0
% 1.36/1.22 AC symbols 0
% 1.36/1.22
% 1.36/1.22 ------ Schedule dynamic 5 is on
% 1.36/1.22
% 1.36/1.22 ------ no conjectures: strip conj schedule
% 1.36/1.22
% 1.36/1.22 ------ no equalities: superposition off
% 1.36/1.22
% 1.36/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22 ------
% 1.36/1.22 Current options:
% 1.36/1.22 ------
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22 ------ Proving...
% 1.36/1.22
% 1.36/1.22
% 1.36/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 1.36/1.22
% 1.36/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.36/1.22
% 1.36/1.22
%------------------------------------------------------------------------------