TSTP Solution File: MSC002-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MSC002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n019.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:20:49 EDT 2023
% Result : Unsatisfiable 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 43 ( 10 unt; 14 typ; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 62 ( 33 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 10 >; 8 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 68 ( 18 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
something: $i ).
tff(decl_23,type,
here: $i ).
tff(decl_24,type,
now: $i ).
tff(decl_25,type,
at: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
hand_at: ( $i * $i ) > $o ).
tff(decl_27,type,
let_go: $i > $i ).
tff(decl_28,type,
go: ( $i * $i ) > $i ).
tff(decl_29,type,
held: ( $i * $i ) > $o ).
tff(decl_30,type,
red: $i > $o ).
tff(decl_31,type,
pick_up: $i > $i ).
tff(decl_32,type,
grabbed: ( $i * $i ) > $o ).
tff(decl_33,type,
there: $i ).
tff(decl_34,type,
put: ( $i * $i * $i ) > $o ).
tff(decl_35,type,
answer: $i > $o ).
cnf(can_put_somewhere_if_grab_and_go_there,axiom,
( put(X1,X4,go(X4,X3))
| ~ at(X1,X2,X3)
| ~ grabbed(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(situation_pick_up,axiom,
( at(X1,X2,pick_up(X3))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',situation_pick_up) ).
cnf(thing_either_held_or_went_there,axiom,
( held(X1,X2)
| at(X1,X3,go(X4,X2))
| ~ at(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thing_either_held_or_went_there) ).
cnf(situation_let_go,axiom,
( at(X1,X2,let_go(X3))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',situation_let_go) ).
cnf(cant_hold_and_let_go,axiom,
~ held(X1,let_go(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cant_hold_and_let_go) ).
cnf(answer_if_red_and_put_there,axiom,
( answer(X2)
| ~ red(X1)
| ~ put(X1,there,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',answer_if_red_and_put_there) ).
cnf(prove_there_is_an_answer_situation,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_an_answer_situation) ).
cnf(something_is_here_now,axiom,
at(something,here,now),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_is_here_now) ).
cnf(everything_is_red,axiom,
( red(X1)
| ~ at(X1,here,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',everything_is_red) ).
cnf(can_grab_if_previously_let_go,axiom,
( grabbed(X1,pick_up(go(X2,let_go(X3))))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',can_grab_if_previously_let_go) ).
cnf(c_0_10,axiom,
( put(X1,X4,go(X4,X3))
| ~ at(X1,X2,X3)
| ~ grabbed(X1,X3) ),
can_put_somewhere_if_grab_and_go_there ).
cnf(c_0_11,axiom,
( at(X1,X2,pick_up(X3))
| ~ at(X1,X2,X3) ),
situation_pick_up ).
cnf(c_0_12,plain,
( put(X1,X2,go(X2,pick_up(X3)))
| ~ grabbed(X1,pick_up(X3))
| ~ at(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( held(X1,X2)
| at(X1,X3,go(X4,X2))
| ~ at(X1,X3,X2) ),
thing_either_held_or_went_there ).
cnf(c_0_14,plain,
( put(X1,X2,go(X2,pick_up(go(X3,X4))))
| held(X1,X4)
| ~ grabbed(X1,pick_up(go(X3,X4)))
| ~ at(X1,X5,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( at(X1,X2,let_go(X3))
| ~ at(X1,X2,X3) ),
situation_let_go ).
cnf(c_0_16,axiom,
~ held(X1,let_go(X2)),
cant_hold_and_let_go ).
cnf(c_0_17,axiom,
( answer(X2)
| ~ red(X1)
| ~ put(X1,there,X2) ),
answer_if_red_and_put_there ).
cnf(c_0_18,negated_conjecture,
~ answer(X1),
prove_there_is_an_answer_situation ).
cnf(c_0_19,plain,
( put(X1,X2,go(X2,pick_up(go(X3,let_go(X4)))))
| ~ grabbed(X1,pick_up(go(X3,let_go(X4))))
| ~ at(X1,X5,X4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,axiom,
at(something,here,now),
something_is_here_now ).
cnf(c_0_21,axiom,
( red(X1)
| ~ at(X1,here,X2) ),
everything_is_red ).
cnf(c_0_22,plain,
( ~ put(X1,there,X2)
| ~ red(X1) ),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( put(something,X1,go(X1,pick_up(go(X2,let_go(now)))))
| ~ grabbed(something,pick_up(go(X2,let_go(now)))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
red(something),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,plain,
~ grabbed(something,pick_up(go(X1,let_go(now)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,axiom,
( grabbed(X1,pick_up(go(X2,let_go(X3))))
| ~ at(X1,X2,X3) ),
can_grab_if_previously_let_go ).
cnf(c_0_27,plain,
~ at(something,X1,now),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MSC002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n019.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 Aug 24 13:37:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.013000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.60 % Total time : 0.016000 s
%------------------------------------------------------------------------------