TSTP Solution File: PLA009-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PLA009-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:19 EDT 2023
% Result : Unsatisfiable 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of clauses : 53 ( 23 unt; 0 nHn; 49 RR)
% Number of literals : 137 ( 0 equ; 96 neg)
% Maximal clause size : 7 ( 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 : 86 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_D_AB,negated_conjecture,
~ holds(and(clear(d),on(a,b)),X1),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',prove_D_AB) ).
cnf(and_definition,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',and_definition) ).
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.MeBsFffveb/E---3.1_6348.p',pickup_3) ).
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.MeBsFffveb/E---3.1_6348.p',pickup_2) ).
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.MeBsFffveb/E---3.1_6348.p',putdown_2) ).
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.MeBsFffveb/E---3.1_6348.p',putdown_1) ).
cnf(putdown_4,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',putdown_4) ).
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.MeBsFffveb/E---3.1_6348.p',putdown_5) ).
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.MeBsFffveb/E---3.1_6348.p',pickup_1) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',differ_a_table) ).
cnf(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',symmetry_of_differ) ).
cnf(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',differ_a_b) ).
cnf(pickup_4,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',pickup_4) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',differ_b_c) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',initial_state3) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',differ_a_c) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',initial_state5) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',initial_state6) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox/tmp/tmp.MeBsFffveb/E---3.1_6348.p',initial_state8) ).
cnf(c_0_20,negated_conjecture,
~ holds(and(clear(d),on(a,b)),X1),
prove_D_AB ).
cnf(c_0_21,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
and_definition ).
cnf(c_0_22,negated_conjecture,
( ~ holds(on(a,b),X1)
| ~ holds(clear(d),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
pickup_3 ).
cnf(c_0_24,negated_conjecture,
( ~ differ(a,X1)
| ~ holds(clear(d),do(pickup(X1),X2))
| ~ holds(on(a,b),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,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_26,negated_conjecture,
( ~ differ(a,X1)
| ~ holds(on(a,b),X2)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2) ),
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,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_1 ).
cnf(c_0_29,negated_conjecture,
( ~ differ(a,X1)
| ~ holds(on(X1,d),do(putdown(a,b),X2))
| ~ holds(clear(X1),do(putdown(a,b),X2))
| ~ holds(holding(a),X2)
| ~ holds(clear(b),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_30,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
putdown_4 ).
cnf(c_0_31,negated_conjecture,
( ~ differ(a,X1)
| ~ holds(clear(X1),do(putdown(a,b),X2))
| ~ holds(on(X1,d),X2)
| ~ holds(holding(a),X2)
| ~ holds(clear(b),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
putdown_5 ).
cnf(c_0_33,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(X1,b)
| ~ holds(on(X1,d),X2)
| ~ holds(holding(a),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(X1,b)
| ~ differ(X1,X2)
| ~ holds(holding(a),do(pickup(X2),X3))
| ~ holds(clear(b),do(pickup(X2),X3))
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X1,d),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_35,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
pickup_1 ).
cnf(c_0_36,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_37,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
symmetry_of_differ ).
cnf(c_0_38,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_39,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(X1,b)
| ~ holds(clear(b),do(pickup(a),X2))
| ~ holds(clear(X1),do(pickup(a),X2))
| ~ holds(on(X1,d),X2)
| ~ holds(clear(a),X2)
| ~ holds(empty,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_40,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
pickup_4 ).
cnf(c_0_41,plain,
differ(b,a),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(X1,b)
| ~ holds(clear(X1),do(pickup(a),X2))
| ~ holds(on(X1,d),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(b),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_43,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_44,negated_conjecture,
( ~ differ(a,X1)
| ~ differ(X1,b)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_37]) ).
cnf(c_0_45,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_46,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_47,plain,
differ(c,b),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_48,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_49,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_50,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_51,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_52,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(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PLA009-2 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 20:35:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.MeBsFffveb/E---3.1_6348.p
% 0.20/0.56 # Version: 3.1pre001
% 0.20/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 # Starting sh5l with 300s (1) cores
% 0.20/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6427 completed with status 0
% 0.20/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.56 # No SInE strategy applied
% 0.20/0.56 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.20/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.56 # Starting sh5l with 136s (1) cores
% 0.20/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6435 completed with status 0
% 0.20/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.56 # No SInE strategy applied
% 0.20/0.56 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.20/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.56 # Preprocessing time : 0.001 s
% 0.20/0.56 # Presaturation interreduction done
% 0.20/0.56
% 0.20/0.56 # Proof found!
% 0.20/0.56 # SZS status Unsatisfiable
% 0.20/0.56 # SZS output start CNFRefutation
% See solution above
% 0.20/0.56 # Parsed axioms : 31
% 0.20/0.56 # Removed by relevancy pruning/SinE : 0
% 0.20/0.56 # Initial clauses : 31
% 0.20/0.56 # Removed in clause preprocessing : 0
% 0.20/0.56 # Initial clauses in saturation : 31
% 0.20/0.56 # Processed clauses : 286
% 0.20/0.56 # ...of these trivial : 0
% 0.20/0.56 # ...subsumed : 34
% 0.20/0.56 # ...remaining for further processing : 252
% 0.20/0.56 # Other redundant clauses eliminated : 0
% 0.20/0.56 # Clauses deleted for lack of memory : 0
% 0.20/0.56 # Backward-subsumed : 8
% 0.20/0.56 # Backward-rewritten : 0
% 0.20/0.56 # Generated clauses : 320
% 0.20/0.56 # ...of the previous two non-redundant : 306
% 0.20/0.56 # ...aggressively subsumed : 0
% 0.20/0.56 # Contextual simplify-reflections : 36
% 0.20/0.56 # Paramodulations : 320
% 0.20/0.56 # Factorizations : 0
% 0.20/0.56 # NegExts : 0
% 0.20/0.56 # Equation resolutions : 0
% 0.20/0.56 # Total rewrite steps : 77
% 0.20/0.56 # Propositional unsat checks : 0
% 0.20/0.56 # Propositional check models : 0
% 0.20/0.56 # Propositional check unsatisfiable : 0
% 0.20/0.56 # Propositional clauses : 0
% 0.20/0.56 # Propositional clauses after purity: 0
% 0.20/0.56 # Propositional unsat core size : 0
% 0.20/0.56 # Propositional preprocessing time : 0.000
% 0.20/0.56 # Propositional encoding time : 0.000
% 0.20/0.56 # Propositional solver time : 0.000
% 0.20/0.56 # Success case prop preproc time : 0.000
% 0.20/0.56 # Success case prop encoding time : 0.000
% 0.20/0.56 # Success case prop solver time : 0.000
% 0.20/0.56 # Current number of processed clauses : 213
% 0.20/0.56 # Positive orientable unit clauses : 29
% 0.20/0.56 # Positive unorientable unit clauses: 0
% 0.20/0.56 # Negative unit clauses : 3
% 0.20/0.56 # Non-unit-clauses : 181
% 0.20/0.56 # Current number of unprocessed clauses: 75
% 0.20/0.56 # ...number of literals in the above : 505
% 0.20/0.56 # Current number of archived formulas : 0
% 0.20/0.56 # Current number of archived clauses : 39
% 0.20/0.56 # Clause-clause subsumption calls (NU) : 46617
% 0.20/0.56 # Rec. Clause-clause subsumption calls : 716
% 0.20/0.56 # Non-unit clause-clause subsumptions : 78
% 0.20/0.56 # Unit Clause-clause subsumption calls : 220
% 0.20/0.56 # Rewrite failures with RHS unbound : 0
% 0.20/0.56 # BW rewrite match attempts : 0
% 0.20/0.56 # BW rewrite match successes : 0
% 0.20/0.56 # Condensation attempts : 0
% 0.20/0.56 # Condensation successes : 0
% 0.20/0.56 # Termbank termtop insertions : 13797
% 0.20/0.56
% 0.20/0.56 # -------------------------------------------------
% 0.20/0.56 # User time : 0.032 s
% 0.20/0.56 # System time : 0.003 s
% 0.20/0.56 # Total time : 0.035 s
% 0.20/0.56 # Maximum resident set size: 1652 pages
% 0.20/0.56
% 0.20/0.56 # -------------------------------------------------
% 0.20/0.56 # User time : 0.284 s
% 0.20/0.56 # System time : 0.010 s
% 0.20/0.56 # Total time : 0.294 s
% 0.20/0.56 # Maximum resident set size: 1692 pages
% 0.20/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------