TSTP Solution File: PLA010-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PLA010-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Tue May 21 02:19:27 EDT 2024
% Result : Unsatisfiable 2.54s 0.83s
% Output : CNFRefutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 27
% Syntax : Number of clauses : 109 ( 37 unt; 0 nHn; 101 RR)
% Number of literals : 348 ( 0 equ; 281 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% 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 : 183 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ADB,negated_conjecture,
~ holds(and(on(a,d),on(d,b)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ADB) ).
cnf(and_definition,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',and_definition) ).
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(putdown_4,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_4) ).
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(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',symmetry_of_differ) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_table) ).
cnf(pickup_3,axiom,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_3) ).
cnf(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_d) ).
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(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(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_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(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_b) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_d_table) ).
cnf(differ_b_d,axiom,
differ(b,d),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_d) ).
cnf(differ_b_table,axiom,
differ(b,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_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(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state3) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_c) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_table) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state6) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state5) ).
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_27,negated_conjecture,
~ holds(and(on(a,d),on(d,b)),X1),
inference(fof_simplification,[status(thm)],[prove_ADB]) ).
cnf(c_0_28,plain,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
inference(fof_simplification,[status(thm)],[and_definition]) ).
cnf(c_0_29,negated_conjecture,
~ holds(and(on(a,d),on(d,b)),X1),
c_0_27 ).
cnf(c_0_30,plain,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
c_0_28 ).
cnf(c_0_31,plain,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
inference(fof_simplification,[status(thm)],[putdown_2]) ).
cnf(c_0_32,negated_conjecture,
( ~ holds(on(d,b),X1)
| ~ holds(on(a,d),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_31 ).
cnf(c_0_34,plain,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
inference(fof_simplification,[status(thm)],[putdown_4]) ).
cnf(c_0_35,negated_conjecture,
( ~ holds(on(d,b),do(putdown(a,d),X1))
| ~ holds(holding(a),X1)
| ~ holds(clear(d),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
c_0_34 ).
cnf(c_0_37,plain,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
inference(fof_simplification,[status(thm)],[pickup_1]) ).
cnf(c_0_38,plain,
( differ(X1,X2)
| ~ differ(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_39,negated_conjecture,
( ~ holds(on(d,b),X1)
| ~ holds(holding(a),X1)
| ~ holds(clear(d),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
c_0_37 ).
cnf(c_0_41,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_42,plain,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
inference(fof_simplification,[status(thm)],[pickup_3]) ).
cnf(c_0_43,plain,
( differ(X1,X2)
| ~ differ(X2,X1) ),
c_0_38 ).
cnf(c_0_44,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_45,negated_conjecture,
( ~ holds(on(d,b),do(pickup(a),X1))
| ~ holds(clear(d),do(pickup(a),X1))
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_46,plain,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
c_0_42 ).
cnf(c_0_47,plain,
differ(d,a),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
inference(fof_simplification,[status(thm)],[pickup_4]) ).
cnf(c_0_49,negated_conjecture,
( ~ holds(clear(d),do(pickup(a),X1))
| ~ holds(on(d,b),X1)
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_50,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
c_0_48 ).
cnf(c_0_51,plain,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
inference(fof_simplification,[status(thm)],[putdown_1]) ).
cnf(c_0_52,plain,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
inference(fof_simplification,[status(thm)],[putdown_3]) ).
cnf(c_0_53,negated_conjecture,
( ~ holds(on(d,b),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_47])]) ).
cnf(c_0_54,plain,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_51 ).
cnf(c_0_55,plain,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_52 ).
cnf(c_0_56,plain,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
inference(fof_simplification,[status(thm)],[putdown_5]) ).
cnf(c_0_57,negated_conjecture,
( ~ holds(clear(a),do(putdown(d,b),X1))
| ~ holds(holding(d),X1)
| ~ holds(clear(b),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_33]),c_0_54]),c_0_55]) ).
cnf(c_0_58,plain,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
c_0_56 ).
cnf(c_0_59,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_60,negated_conjecture,
( ~ holds(holding(d),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_61,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_62,negated_conjecture,
( ~ holds(clear(b),do(pickup(d),X1))
| ~ holds(clear(a),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_60,c_0_40]),c_0_61])]) ).
cnf(c_0_63,axiom,
differ(b,d),
differ_b_d ).
cnf(c_0_64,negated_conjecture,
( ~ holds(clear(a),do(pickup(d),X1))
| ~ holds(clear(d),X1)
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_50]),c_0_63])]) ).
cnf(c_0_65,negated_conjecture,
( ~ holds(clear(d),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_50]),c_0_44])]) ).
cnf(c_0_66,negated_conjecture,
( ~ holds(clear(d),do(putdown(b,X1),X2))
| ~ holds(clear(a),do(putdown(b,X1),X2))
| ~ holds(holding(b),X2)
| ~ holds(clear(X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_55]),c_0_54]) ).
cnf(c_0_67,negated_conjecture,
( ~ differ(a,X1)
| ~ holds(clear(d),do(putdown(b,X1),X2))
| ~ holds(holding(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(X1),X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_58]) ).
cnf(c_0_68,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(d,X1)
| ~ holds(holding(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(d),X2)
| ~ holds(clear(X1),X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_58]) ).
cnf(c_0_69,axiom,
differ(b,table),
differ_b_table ).
cnf(c_0_70,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(d,X1)
| ~ holds(clear(a),do(pickup(b),X2))
| ~ holds(clear(d),do(pickup(b),X2))
| ~ holds(clear(X1),do(pickup(b),X2))
| ~ holds(clear(b),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_40]),c_0_69])]) ).
cnf(c_0_71,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
inference(fof_simplification,[status(thm)],[pickup_2]) ).
cnf(c_0_72,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(d,X1)
| ~ holds(clear(d),do(pickup(b),X2))
| ~ holds(clear(X1),do(pickup(b),X2))
| ~ holds(clear(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_50]),c_0_59])]) ).
cnf(c_0_73,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
c_0_71 ).
cnf(c_0_74,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(d,X1)
| ~ holds(clear(X1),do(pickup(b),X2))
| ~ holds(on(b,d),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(empty,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,axiom,
holds(clear(table),X1),
clear_table ).
cnf(c_0_76,negated_conjecture,
( ~ holds(on(b,d),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_41]),c_0_61])]) ).
cnf(c_0_77,negated_conjecture,
( ~ holds(clear(a),do(putdown(b,d),X1))
| ~ holds(holding(b),X1)
| ~ holds(clear(d),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_33]),c_0_54]),c_0_55]) ).
cnf(c_0_78,negated_conjecture,
( ~ holds(holding(b),X1)
| ~ holds(clear(d),X1)
| ~ holds(clear(a),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_58]),c_0_44])]) ).
cnf(c_0_79,negated_conjecture,
( ~ holds(clear(d),do(pickup(b),X1))
| ~ holds(clear(a),do(pickup(b),X1))
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_40]),c_0_69])]) ).
cnf(c_0_80,negated_conjecture,
( ~ holds(clear(d),do(pickup(b),X1))
| ~ holds(on(b,a),X1)
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_73]) ).
cnf(c_0_81,plain,
differ(d,b),
inference(spm,[status(thm)],[c_0_43,c_0_63]) ).
cnf(c_0_82,negated_conjecture,
( ~ holds(on(b,a),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_50]),c_0_81])]) ).
cnf(c_0_83,negated_conjecture,
( ~ holds(clear(b),do(putdown(X1,X2),X3))
| ~ holds(clear(d),do(putdown(X1,X2),X3))
| ~ holds(empty,do(putdown(X1,X2),X3))
| ~ holds(on(b,a),X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_36]) ).
cnf(c_0_84,negated_conjecture,
( ~ differ(b,X1)
| ~ holds(clear(d),do(putdown(X2,X1),X3))
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(on(b,a),X3)
| ~ holds(clear(b),X3) ),
inference(spm,[status(thm)],[c_0_83,c_0_58]) ).
cnf(c_0_85,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(d,X1)
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(on(b,a),X3)
| ~ holds(clear(b),X3)
| ~ holds(clear(d),X3) ),
inference(spm,[status(thm)],[c_0_84,c_0_58]) ).
cnf(c_0_86,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(d,X1)
| ~ holds(on(b,a),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(d),X2)
| ~ holds(holding(X3),X2)
| ~ holds(clear(X1),X2) ),
inference(spm,[status(thm)],[c_0_85,c_0_54]) ).
cnf(c_0_87,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(d,X1)
| ~ differ(b,X2)
| ~ holds(clear(b),do(pickup(X2),X3))
| ~ holds(clear(d),do(pickup(X2),X3))
| ~ holds(holding(X4),do(pickup(X2),X3))
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(b,a),X3) ),
inference(spm,[status(thm)],[c_0_86,c_0_46]) ).
cnf(c_0_88,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(d,X1)
| ~ differ(b,X2)
| ~ holds(clear(d),do(pickup(X2),X3))
| ~ holds(holding(X4),do(pickup(X2),X3))
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(b,a),X3)
| ~ holds(clear(b),X3) ),
inference(spm,[status(thm)],[c_0_87,c_0_50]) ).
cnf(c_0_89,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(d,X1)
| ~ differ(b,X2)
| ~ holds(holding(X3),do(pickup(X2),X4))
| ~ holds(clear(X1),do(pickup(X2),X4))
| ~ holds(on(b,a),X4)
| ~ holds(on(X2,d),X4)
| ~ holds(clear(b),X4)
| ~ holds(clear(X2),X4)
| ~ holds(empty,X4) ),
inference(spm,[status(thm)],[c_0_88,c_0_73]) ).
cnf(c_0_90,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(d,X1)
| ~ differ(b,X2)
| ~ differ(X2,table)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(b,a),X3)
| ~ holds(on(X2,d),X3)
| ~ holds(clear(b),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
inference(spm,[status(thm)],[c_0_89,c_0_40]) ).
cnf(c_0_91,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ holds(on(b,a),X2)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_75]),c_0_69]),c_0_61])]) ).
cnf(c_0_92,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ holds(on(X1,d),do(putdown(b,a),X2))
| ~ holds(clear(X1),do(putdown(b,a),X2))
| ~ holds(holding(b),X2)
| ~ holds(clear(a),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_33]),c_0_54]),c_0_55]) ).
cnf(c_0_93,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ holds(clear(X1),do(putdown(b,a),X2))
| ~ holds(on(X1,d),X2)
| ~ holds(holding(b),X2)
| ~ holds(clear(a),X2) ),
inference(spm,[status(thm)],[c_0_92,c_0_36]) ).
cnf(c_0_94,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ differ(X1,a)
| ~ holds(on(X1,d),X2)
| ~ holds(holding(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(X1),X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_58]) ).
cnf(c_0_95,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ differ(X1,a)
| ~ differ(X1,X2)
| ~ holds(holding(b),do(pickup(X2),X3))
| ~ holds(clear(a),do(pickup(X2),X3))
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X1,d),X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_46]) ).
cnf(c_0_96,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ differ(X1,a)
| ~ holds(clear(a),do(pickup(b),X2))
| ~ holds(clear(X1),do(pickup(b),X2))
| ~ holds(on(X1,d),X2)
| ~ holds(clear(b),X2)
| ~ holds(empty,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_40]),c_0_69])]),c_0_43]) ).
cnf(c_0_97,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ differ(X1,a)
| ~ holds(clear(X1),do(pickup(b),X2))
| ~ holds(on(X1,d),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_50]),c_0_59])]) ).
cnf(c_0_98,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_99,negated_conjecture,
( ~ differ(b,X1)
| ~ differ(X1,table)
| ~ differ(X1,a)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_50]),c_0_43]) ).
cnf(c_0_100,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_101,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_102,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_103,plain,
differ(c,a),
inference(spm,[status(thm)],[c_0_43,c_0_98]) ).
cnf(c_0_104,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_105,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_106,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_107,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_99,c_0_100]),c_0_101]),c_0_102]),c_0_103]),c_0_104]),c_0_105]),c_0_106]),c_0_107])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : PLA010-1 : TPTP v8.2.0. Released v1.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 13:38:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.47 Running first-order model finding
% 0.22/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.54/0.82 # Version: 3.1.0
% 2.54/0.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.54/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.54/0.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.54/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.54/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.54/0.82 # Starting sh5l with 300s (1) cores
% 2.54/0.82 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20903 completed with status 0
% 2.54/0.82 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.54/0.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.54/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.54/0.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.54/0.82 # No SInE strategy applied
% 2.54/0.82 # Search class: FHUNF-FFMM21-SFFFFFNN
% 2.54/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.54/0.82 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 2.54/0.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.54/0.82 # Starting new_bool_3 with 136s (1) cores
% 2.54/0.82 # Starting new_bool_1 with 136s (1) cores
% 2.54/0.82 # Starting sh5l with 136s (1) cores
% 2.54/0.83 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20910 completed with status 0
% 2.54/0.83 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.54/0.83 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.54/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.54/0.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.54/0.83 # No SInE strategy applied
% 2.54/0.83 # Search class: FHUNF-FFMM21-SFFFFFNN
% 2.54/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.54/0.83 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 2.54/0.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.54/0.83 # Preprocessing time : 0.001 s
% 2.54/0.83 # Presaturation interreduction done
% 2.54/0.83
% 2.54/0.83 # Proof found!
% 2.54/0.83 # SZS status Unsatisfiable
% 2.54/0.83 # SZS output start CNFRefutation
% See solution above
% 2.54/0.83 # Parsed axioms : 31
% 2.54/0.83 # Removed by relevancy pruning/SinE : 0
% 2.54/0.83 # Initial clauses : 31
% 2.54/0.83 # Removed in clause preprocessing : 0
% 2.54/0.83 # Initial clauses in saturation : 31
% 2.54/0.83 # Processed clauses : 1379
% 2.54/0.83 # ...of these trivial : 0
% 2.54/0.83 # ...subsumed : 246
% 2.54/0.83 # ...remaining for further processing : 1133
% 2.54/0.83 # Other redundant clauses eliminated : 0
% 2.54/0.83 # Clauses deleted for lack of memory : 0
% 2.54/0.83 # Backward-subsumed : 115
% 2.54/0.83 # Backward-rewritten : 0
% 2.54/0.83 # Generated clauses : 1551
% 2.54/0.83 # ...of the previous two non-redundant : 1537
% 2.54/0.83 # ...aggressively subsumed : 0
% 2.54/0.83 # Contextual simplify-reflections : 156
% 2.54/0.83 # Paramodulations : 1551
% 2.54/0.83 # Factorizations : 0
% 2.54/0.83 # NegExts : 0
% 2.54/0.83 # Equation resolutions : 0
% 2.54/0.83 # Disequality decompositions : 0
% 2.54/0.83 # Total rewrite steps : 341
% 2.54/0.83 # ...of those cached : 319
% 2.54/0.83 # Propositional unsat checks : 0
% 2.54/0.83 # Propositional check models : 0
% 2.54/0.83 # Propositional check unsatisfiable : 0
% 2.54/0.83 # Propositional clauses : 0
% 2.54/0.83 # Propositional clauses after purity: 0
% 2.54/0.83 # Propositional unsat core size : 0
% 2.54/0.83 # Propositional preprocessing time : 0.000
% 2.54/0.83 # Propositional encoding time : 0.000
% 2.54/0.83 # Propositional solver time : 0.000
% 2.54/0.83 # Success case prop preproc time : 0.000
% 2.54/0.83 # Success case prop encoding time : 0.000
% 2.54/0.83 # Success case prop solver time : 0.000
% 2.54/0.83 # Current number of processed clauses : 987
% 2.54/0.83 # Positive orientable unit clauses : 29
% 2.54/0.83 # Positive unorientable unit clauses: 0
% 2.54/0.83 # Negative unit clauses : 4
% 2.54/0.83 # Non-unit-clauses : 954
% 2.54/0.83 # Current number of unprocessed clauses: 135
% 2.54/0.83 # ...number of literals in the above : 1204
% 2.54/0.83 # Current number of archived formulas : 0
% 2.54/0.83 # Current number of archived clauses : 146
% 2.54/0.83 # Clause-clause subsumption calls (NU) : 889547
% 2.54/0.83 # Rec. Clause-clause subsumption calls : 5660
% 2.54/0.83 # Non-unit clause-clause subsumptions : 514
% 2.54/0.83 # Unit Clause-clause subsumption calls : 1819
% 2.54/0.83 # Rewrite failures with RHS unbound : 0
% 2.54/0.83 # BW rewrite match attempts : 0
% 2.54/0.83 # BW rewrite match successes : 0
% 2.54/0.83 # Condensation attempts : 0
% 2.54/0.83 # Condensation successes : 0
% 2.54/0.83 # Termbank termtop insertions : 85063
% 2.54/0.83 # Search garbage collected termcells : 55
% 2.54/0.83
% 2.54/0.83 # -------------------------------------------------
% 2.54/0.83 # User time : 0.338 s
% 2.54/0.83 # System time : 0.006 s
% 2.54/0.83 # Total time : 0.344 s
% 2.54/0.83 # Maximum resident set size: 1676 pages
% 2.54/0.83
% 2.54/0.83 # -------------------------------------------------
% 2.54/0.83 # User time : 1.683 s
% 2.54/0.83 # System time : 0.010 s
% 2.54/0.83 # Total time : 1.694 s
% 2.54/0.83 # Maximum resident set size: 1724 pages
% 2.54/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------