TSTP Solution File: PLA005-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PLA005-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:10:18 EDT 2023
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 24
% Syntax : Number of clauses : 64 ( 31 unt; 0 nHn; 60 RR)
% Number of literals : 143 ( 0 equ; 94 neg)
% Maximal clause size : 5 ( 2 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 : 79 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_DB_AC,negated_conjecture,
~ holds(and(on(d,b),on(c,a)),X1),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',prove_DB_AC) ).
cnf(and_definition,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',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/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',putdown_2) ).
cnf(putdown_4,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',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/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',pickup_1) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',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/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',pickup_3) ).
cnf(differ_c_d,axiom,
differ(c,d),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',differ_c_d) ).
cnf(pickup_4,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',pickup_4) ).
cnf(differ_b_d,axiom,
differ(b,d),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',differ_b_d) ).
cnf(putdown_1,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',putdown_1) ).
cnf(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',symmetry_of_differ) ).
cnf(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',differ_a_d) ).
cnf(putdown_5,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',putdown_5) ).
cnf(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',differ_a_b) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',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/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',pickup_2) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',differ_b_c) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',differ_a_c) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',initial_state3) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',initial_state7) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',initial_state6) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',initial_state5) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p',initial_state8) ).
cnf(c_0_24,negated_conjecture,
~ holds(and(on(d,b),on(c,a)),X1),
prove_DB_AC ).
cnf(c_0_25,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
and_definition ).
cnf(c_0_26,negated_conjecture,
( ~ holds(on(c,a),X1)
| ~ holds(on(d,b),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_2 ).
cnf(c_0_28,negated_conjecture,
( ~ holds(on(c,a),do(putdown(d,b),X1))
| ~ holds(holding(d),X1)
| ~ holds(clear(b),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
putdown_4 ).
cnf(c_0_30,negated_conjecture,
( ~ holds(on(c,a),X1)
| ~ holds(holding(d),X1)
| ~ holds(clear(b),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
pickup_1 ).
cnf(c_0_32,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_33,negated_conjecture,
( ~ holds(on(c,a),do(pickup(d),X1))
| ~ holds(clear(b),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_30,c_0_31]),c_0_32])]) ).
cnf(c_0_34,axiom,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
pickup_3 ).
cnf(c_0_35,axiom,
differ(c,d),
differ_c_d ).
cnf(c_0_36,negated_conjecture,
( ~ holds(clear(b),do(pickup(d),X1))
| ~ holds(on(c,a),X1)
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_37,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
pickup_4 ).
cnf(c_0_38,axiom,
differ(b,d),
differ_b_d ).
cnf(c_0_39,negated_conjecture,
( ~ holds(on(c,a),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_36,c_0_37]),c_0_38])]) ).
cnf(c_0_40,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_1 ).
cnf(c_0_41,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
symmetry_of_differ ).
cnf(c_0_42,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_43,negated_conjecture,
( ~ holds(clear(d),do(putdown(c,a),X1))
| ~ holds(clear(b),do(putdown(c,a),X1))
| ~ holds(holding(c),X1)
| ~ holds(clear(a),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_27]),c_0_40]) ).
cnf(c_0_44,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
putdown_5 ).
cnf(c_0_45,plain,
differ(d,a),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_47,negated_conjecture,
( ~ holds(clear(b),do(putdown(c,a),X1))
| ~ holds(holding(c),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_48,plain,
differ(b,a),
inference(spm,[status(thm)],[c_0_41,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ holds(holding(c),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),X1)
| ~ holds(clear(b),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_48])]) ).
cnf(c_0_50,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_51,negated_conjecture,
( ~ holds(clear(a),do(pickup(c),X1))
| ~ holds(clear(d),do(pickup(c),X1))
| ~ holds(clear(b),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_49,c_0_31]),c_0_50])]) ).
cnf(c_0_52,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_53,negated_conjecture,
( ~ holds(clear(a),do(pickup(c),X1))
| ~ 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_51,c_0_52]) ).
cnf(c_0_54,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_55,negated_conjecture,
( ~ holds(clear(a),do(pickup(c),X1))
| ~ 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_53,c_0_37]),c_0_54])]) ).
cnf(c_0_56,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_57,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(clear(c),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_55,c_0_37]),c_0_56])]) ).
cnf(c_0_58,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_59,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_60,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_61,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_62,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_61]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PLA005-2 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 20:13:04 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.VAcJuD1nJw/E---3.1_20899.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21029 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.45 # Starting sh5l with 136s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21038 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Unsatisfiable
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 31
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 31
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 31
% 0.17/0.45 # Processed clauses : 121
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 5
% 0.17/0.45 # ...remaining for further processing : 116
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 1
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 110
% 0.17/0.45 # ...of the previous two non-redundant : 96
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 2
% 0.17/0.45 # Paramodulations : 110
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 42
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 84
% 0.17/0.45 # Positive orientable unit clauses : 29
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 2
% 0.17/0.45 # Non-unit-clauses : 53
% 0.17/0.45 # Current number of unprocessed clauses: 37
% 0.17/0.45 # ...number of literals in the above : 209
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 32
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 1708
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 132
% 0.17/0.45 # Non-unit clause-clause subsumptions : 7
% 0.17/0.45 # Unit Clause-clause subsumption calls : 33
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 4283
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.009 s
% 0.17/0.45 # System time : 0.001 s
% 0.17/0.45 # Total time : 0.009 s
% 0.17/0.45 # Maximum resident set size: 1652 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.037 s
% 0.17/0.45 # System time : 0.007 s
% 0.17/0.45 # Total time : 0.044 s
% 0.17/0.45 # Maximum resident set size: 1692 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------