TSTP Solution File: PLA017-10 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PLA017-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n028.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 12:59:18 EDT 2023
% Result : Unsatisfiable 0.21s 0.82s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 29
% Syntax : Number of formulae : 46 ( 28 unt; 18 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-4 aty)
% Number of variables : 30 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(decl_23,type,
holds: ( $i * $i ) > $i ).
tff(decl_24,type,
true: $i ).
tff(decl_25,type,
and: ( $i * $i ) > $i ).
tff(decl_26,type,
table: $i ).
tff(decl_27,type,
differ: ( $i * $i ) > $i ).
tff(decl_28,type,
empty: $i ).
tff(decl_29,type,
clear: $i > $i ).
tff(decl_30,type,
holding: $i > $i ).
tff(decl_31,type,
pickup: $i > $i ).
tff(decl_32,type,
do: ( $i * $i ) > $i ).
tff(decl_33,type,
on: ( $i * $i ) > $i ).
tff(decl_34,type,
putdown: ( $i * $i ) > $i ).
tff(decl_35,type,
a: $i ).
tff(decl_36,type,
b: $i ).
tff(decl_37,type,
c: $i ).
tff(decl_38,type,
d: $i ).
tff(decl_39,type,
s0: $i ).
cnf(pickup_1,axiom,
ifeq(differ(X1,table),true,ifeq(holds(empty,X2),true,ifeq(holds(clear(X1),X2),true,holds(holding(X1),do(pickup(X1),X2)),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pickup_1) ).
cnf(initial_state5,axiom,
holds(clear(a),s0) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_state5) ).
cnf(differ_a_table,axiom,
differ(a,table) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',differ_a_table) ).
cnf(initial_state8,axiom,
holds(empty,s0) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_state8) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(pickup_4,axiom,
ifeq(differ(X1,X2),true,ifeq(holds(clear(X1),X3),true,holds(clear(X1),do(pickup(X2),X3)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pickup_4) ).
cnf(initial_state7,axiom,
holds(clear(c),s0) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_state7) ).
cnf(symmetry_of_differ,axiom,
ifeq(differ(X1,X2),true,differ(X2,X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_differ) ).
cnf(differ_a_c,axiom,
differ(a,c) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',differ_a_c) ).
cnf(putdown_2,axiom,
ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(on(X1,X3),do(putdown(X1,X3),X2)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',putdown_2) ).
cnf(prove_AC,negated_conjecture,
holds(on(a,c),X1) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_AC) ).
cnf(c_0_11,axiom,
ifeq(differ(X1,table),true,ifeq(holds(empty,X2),true,ifeq(holds(clear(X1),X2),true,holds(holding(X1),do(pickup(X1),X2)),true),true),true) = true,
pickup_1 ).
cnf(c_0_12,axiom,
holds(clear(a),s0) = true,
initial_state5 ).
cnf(c_0_13,axiom,
differ(a,table) = true,
differ_a_table ).
cnf(c_0_14,axiom,
holds(empty,s0) = true,
initial_state8 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
ifeq(differ(X1,X2),true,ifeq(holds(clear(X1),X3),true,holds(clear(X1),do(pickup(X2),X3)),true),true) = true,
pickup_4 ).
cnf(c_0_17,axiom,
holds(clear(c),s0) = true,
initial_state7 ).
cnf(c_0_18,axiom,
ifeq(differ(X1,X2),true,differ(X2,X1),true) = true,
symmetry_of_differ ).
cnf(c_0_19,axiom,
differ(a,c) = true,
differ_a_c ).
cnf(c_0_20,axiom,
ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(on(X1,X3),do(putdown(X1,X3),X2)),true),true) = true,
putdown_2 ).
cnf(c_0_21,plain,
holds(holding(a),do(pickup(a),s0)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_22,plain,
ifeq(differ(c,X1),true,holds(clear(c),do(pickup(X1),s0)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_23,plain,
differ(c,a) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
cnf(c_0_24,plain,
ifeq(holds(clear(X1),do(pickup(a),s0)),true,holds(on(a,X1),do(putdown(a,X1),do(pickup(a),s0))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_25,plain,
holds(clear(c),do(pickup(a),s0)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
holds(on(a,c),X1) != true,
prove_AC ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA017-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Aug 27 06:20:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.55 start to proof: theBenchmark
% 0.21/0.82 % Version : CSE_E---1.5
% 0.21/0.82 % Problem : theBenchmark.p
% 0.21/0.82 % Proof found
% 0.21/0.82 % SZS status Theorem for theBenchmark.p
% 0.21/0.82 % SZS output start Proof
% See solution above
% 0.21/0.82 % Total time : 0.230000 s
% 0.21/0.82 % SZS output end Proof
% 0.21/0.82 % Total time : 0.233000 s
%------------------------------------------------------------------------------