TSTP Solution File: PLA019-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PLA019-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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:19 EDT 2023
% Result : Unsatisfiable 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of formulae : 55 ( 17 unt; 16 typ; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 116 ( 63 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 9 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
and: ( $i * $i ) > $i ).
tff(decl_23,type,
holds: ( $i * $i ) > $o ).
tff(decl_24,type,
holding: $i > $i ).
tff(decl_25,type,
pickup: $i > $i ).
tff(decl_26,type,
do: ( $i * $i ) > $i ).
tff(decl_27,type,
empty: $i ).
tff(decl_28,type,
clear: $i > $i ).
tff(decl_29,type,
table: $i ).
tff(decl_30,type,
differ: ( $i * $i ) > $o ).
tff(decl_31,type,
on: ( $i * $i ) > $i ).
tff(decl_32,type,
putdown: ( $i * $i ) > $i ).
tff(decl_33,type,
a: $i ).
tff(decl_34,type,
b: $i ).
tff(decl_35,type,
c: $i ).
tff(decl_36,type,
d: $i ).
tff(decl_37,type,
s0: $i ).
cnf(prove_DC,negated_conjecture,
~ holds(on(d,c),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_DC) ).
cnf(putdown_2,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_2) ).
cnf(pickup_1,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_1) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_d_table) ).
cnf(pickup_4,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_4) ).
cnf(differ_c_d,axiom,
differ(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_d) ).
cnf(putdown_5,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_5) ).
cnf(putdown_3,axiom,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_3) ).
cnf(putdown_1,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_1) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_table) ).
cnf(pickup_2,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_2) ).
cnf(clear_table,axiom,
holds(clear(table),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',clear_table) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state3) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state8) ).
cnf(c_0_15,negated_conjecture,
~ holds(on(d,c),X1),
prove_DC ).
cnf(c_0_16,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_2 ).
cnf(c_0_17,negated_conjecture,
( ~ holds(holding(d),X1)
| ~ holds(clear(c),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
pickup_1 ).
cnf(c_0_19,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_20,negated_conjecture,
( ~ holds(clear(c),do(pickup(d),X1))
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
pickup_4 ).
cnf(c_0_22,axiom,
differ(c,d),
differ_c_d ).
cnf(c_0_23,negated_conjecture,
( ~ holds(clear(d),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_24,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
putdown_5 ).
cnf(c_0_25,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(c),do(putdown(X2,X1),X3))
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(clear(d),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,axiom,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_3 ).
cnf(c_0_27,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_1 ).
cnf(c_0_28,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(d),X2)
| ~ holds(holding(c),X2)
| ~ holds(clear(X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_30,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(d),do(pickup(c),X2))
| ~ holds(clear(X1),do(pickup(c),X2))
| ~ holds(clear(c),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29])]) ).
cnf(c_0_31,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
pickup_2 ).
cnf(c_0_32,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(X1),do(pickup(c),X2))
| ~ holds(on(c,d),X2)
| ~ holds(clear(c),X2)
| ~ holds(empty,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,axiom,
holds(clear(table),X1),
clear_table ).
cnf(c_0_34,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19])]) ).
cnf(c_0_35,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_36,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_37,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA019-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 06:04:32 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.58 % Version : CSE_E---1.5
% 0.21/0.58 % Problem : theBenchmark.p
% 0.21/0.58 % Proof found
% 0.21/0.58 % SZS status Theorem for theBenchmark.p
% 0.21/0.58 % SZS output start Proof
% See solution above
% 0.21/0.58 % Total time : 0.008000 s
% 0.21/0.58 % SZS output end Proof
% 0.21/0.58 % Total time : 0.011000 s
%------------------------------------------------------------------------------