TSTP Solution File: PLA011-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PLA011-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of clauses : 67 ( 23 unt; 0 nHn; 61 RR)
% Number of literals : 160 ( 0 equ; 107 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 119 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_DCB,negated_conjecture,
~ holds(and(on(d,c),on(c,b)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_DCB) ).
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(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_d_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_c_d,axiom,
differ(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_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(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',symmetry_of_differ) ).
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_b_d,axiom,
differ(b,d),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_d) ).
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(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_c) ).
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_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state6) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state8) ).
cnf(c_0_21,negated_conjecture,
~ holds(and(on(d,c),on(c,b)),X1),
inference(fof_simplification,[status(thm)],[prove_DCB]) ).
cnf(c_0_22,plain,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
inference(fof_simplification,[status(thm)],[and_definition]) ).
cnf(c_0_23,negated_conjecture,
~ holds(and(on(d,c),on(c,b)),X1),
c_0_21 ).
cnf(c_0_24,plain,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
c_0_22 ).
cnf(c_0_25,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_26,negated_conjecture,
( ~ holds(on(c,b),X1)
| ~ holds(on(d,c),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_25 ).
cnf(c_0_28,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_29,negated_conjecture,
( ~ holds(on(c,b),do(putdown(d,c),X1))
| ~ holds(holding(d),X1)
| ~ holds(clear(c),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
c_0_28 ).
cnf(c_0_31,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_32,negated_conjecture,
( ~ holds(on(c,b),X1)
| ~ holds(holding(d),X1)
| ~ holds(clear(c),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
c_0_31 ).
cnf(c_0_34,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_35,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_36,negated_conjecture,
( ~ holds(on(c,b),do(pickup(d),X1))
| ~ 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_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,plain,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
c_0_35 ).
cnf(c_0_38,axiom,
differ(c,d),
differ_c_d ).
cnf(c_0_39,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_40,negated_conjecture,
( ~ holds(clear(c),do(pickup(d),X1))
| ~ holds(on(c,b),X1)
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_41,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
c_0_39 ).
cnf(c_0_42,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_43,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_44,plain,
( differ(X1,X2)
| ~ differ(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_45,negated_conjecture,
( ~ holds(on(c,b),X1)
| ~ 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_40,c_0_41]),c_0_38])]) ).
cnf(c_0_46,plain,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_42 ).
cnf(c_0_47,plain,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_43 ).
cnf(c_0_48,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_49,plain,
( differ(X1,X2)
| ~ differ(X2,X1) ),
c_0_44 ).
cnf(c_0_50,axiom,
differ(b,d),
differ_b_d ).
cnf(c_0_51,negated_conjecture,
( ~ holds(clear(d),do(putdown(c,b),X1))
| ~ holds(holding(c),X1)
| ~ holds(clear(b),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_27]),c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
c_0_48 ).
cnf(c_0_53,plain,
differ(d,b),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ holds(holding(c),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(d),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_55,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_56,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_57,negated_conjecture,
( ~ holds(clear(b),do(pickup(c),X1))
| ~ holds(clear(d),do(pickup(c),X1))
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_33]),c_0_55])]) ).
cnf(c_0_58,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
c_0_56 ).
cnf(c_0_59,negated_conjecture,
( ~ holds(clear(b),do(pickup(c),X1))
| ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_61,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_41]),c_0_60])]) ).
cnf(c_0_62,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_63,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_64,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_65,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA011-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 13:40:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6424 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 6428 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 31
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 31
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 31
% 0.20/0.50 # Processed clauses : 106
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 4
% 0.20/0.50 # ...remaining for further processing : 102
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 80
% 0.20/0.50 # ...of the previous two non-redundant : 66
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 3
% 0.20/0.50 # Paramodulations : 80
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 28
% 0.20/0.50 # ...of those cached : 13
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 71
% 0.20/0.50 # Positive orientable unit clauses : 29
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 41
% 0.20/0.50 # Current number of unprocessed clauses: 22
% 0.20/0.50 # ...number of literals in the above : 122
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 31
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 744
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 120
% 0.20/0.50 # Non-unit clause-clause subsumptions : 7
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3075
% 0.20/0.50 # Search garbage collected termcells : 55
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1680 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.035 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.043 s
% 0.20/0.50 # Maximum resident set size: 1728 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------