TSTP Solution File: PLA007-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PLA007-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : Timeout 0.45s 300.14s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 48 ( 24 unt; 0 nHn; 44 RR)
% Number of literals : 122 ( 0 equ; 86 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_AD,negated_conjecture,
~ holds(on(a,d),X1),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',prove_AD) ).
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/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',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/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',pickup_1) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',differ_a_table) ).
cnf(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',symmetry_of_differ) ).
cnf(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',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/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',pickup_4) ).
cnf(putdown_5,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',putdown_5) ).
cnf(putdown_1,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',putdown_1) ).
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/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',pickup_2) ).
cnf(clear_table,axiom,
holds(clear(table),X1),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',clear_table) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',differ_d_table) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',initial_state3) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',differ_c_table) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',differ_a_c) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',initial_state5) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox2/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p',initial_state8) ).
cnf(c_0_18,negated_conjecture,
~ holds(on(a,d),X1),
prove_AD ).
cnf(c_0_19,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_2 ).
cnf(c_0_20,negated_conjecture,
( ~ holds(holding(a),X1)
| ~ holds(clear(d),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
pickup_1 ).
cnf(c_0_22,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_23,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
symmetry_of_differ ).
cnf(c_0_24,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_25,negated_conjecture,
( ~ 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_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
pickup_4 ).
cnf(c_0_27,plain,
differ(d,a),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ 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_25,c_0_26]),c_0_27])]) ).
cnf(c_0_29,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
putdown_5 ).
cnf(c_0_30,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(a),do(putdown(X2,X1),X3))
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(clear(d),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( ~ differ(d,X1)
| ~ differ(a,X1)
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(clear(d),X3)
| ~ holds(clear(a),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_32,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_1 ).
cnf(c_0_33,negated_conjecture,
( ~ differ(d,X1)
| ~ differ(a,X1)
| ~ holds(clear(d),X2)
| ~ holds(clear(a),X2)
| ~ holds(holding(X3),X2)
| ~ holds(clear(X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( ~ differ(d,X1)
| ~ differ(a,X1)
| ~ differ(X2,table)
| ~ holds(clear(d),do(pickup(X2),X3))
| ~ holds(clear(a),do(pickup(X2),X3))
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_35,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_36,negated_conjecture,
( ~ differ(d,X1)
| ~ differ(a,X1)
| ~ differ(X2,table)
| ~ holds(clear(a),do(pickup(X2),X3))
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,d),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( ~ differ(d,X1)
| ~ differ(a,X1)
| ~ differ(X2,table)
| ~ differ(a,X2)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,d),X3)
| ~ holds(clear(a),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_38,axiom,
holds(clear(table),X1),
clear_table ).
cnf(c_0_39,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_40,negated_conjecture,
( ~ differ(X1,table)
| ~ differ(a,X1)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(a),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_37,c_0_38]),c_0_39]),c_0_22])]) ).
cnf(c_0_41,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_42,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_43,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_44,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_45,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_46,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_47,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(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]),c_0_44]),c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : PLA007-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.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:25:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/tmp/tmp.iQSmGqHn3O/E---3.1_29995.p
% 0.45/300.14 # Version: 3.1pre001
% 0.45/300.14 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.14 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.14 # Starting sh5l with 300s (1) cores
% 0.45/300.14 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30092 completed with status 0
% 0.45/300.14 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.45/300.14 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.14 # No SInE strategy applied
% 0.45/300.14 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.45/300.14 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/300.14 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.45/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.45/300.14 # Starting new_bool_3 with 136s (1) cores
% 0.45/300.14 # Starting new_bool_1 with 136s (1) cores
% 0.45/300.14 # Starting sh5l with 136s (1) cores
% 0.45/300.14 # SAT001_MinMin_p005000_rr_RG with pid 30117 completed with status 0
% 0.45/300.14 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.45/300.14 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.14 # No SInE strategy applied
% 0.45/300.14 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.45/300.14 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/300.14 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.45/300.14 # Preprocessing time : 0.001 s
% 0.45/300.14 # Presaturation interreduction done
% 0.45/300.14
% 0.45/300.14 # Proof found!
% 0.45/300.14 # SZS status Unsatisfiable
% 0.45/300.14 # SZS output start CNFRefutation
% See solution above
% 0.45/300.14 # Parsed axioms : 31
% 0.45/300.14 # Removed by relevancy pruning/SinE : 0
% 0.45/300.14 # Initial clauses : 31
% 0.45/300.14 # Removed in clause preprocessing : 0
% 0.45/300.14 # Initial clauses in saturation : 31
% 0.45/300.14 # Processed clauses : 161
% 0.45/300.14 # ...of these trivial : 0
% 0.45/300.14 # ...subsumed : 15
% 0.45/300.14 # ...remaining for further processing : 146
% 0.45/300.14 # Other redundant clauses eliminated : 0
% 0.45/300.14 # Clauses deleted for lack of memory : 0
% 0.45/300.14 # Backward-subsumed : 8
% 0.45/300.14 # Backward-rewritten : 0
% 0.45/300.14 # Generated clauses : 136
% 0.45/300.14 # ...of the previous two non-redundant : 122
% 0.45/300.14 # ...aggressively subsumed : 0
% 0.45/300.14 # Contextual simplify-reflections : 10
% 0.45/300.14 # Paramodulations : 136
% 0.45/300.14 # Factorizations : 0
% 0.45/300.14 # NegExts : 0
% 0.45/300.14 # Equation resolutions : 0
% 0.45/300.14 # Total rewrite steps : 43
% 0.45/300.14 # Propositional unsat checks : 0
% 0.45/300.14 # Propositional check models : 0
% 0.45/300.14 # Propositional check unsatisfiable : 0
% 0.45/300.14 # Propositional clauses : 0
% 0.45/300.14 # Propositional clauses after purity: 0
% 0.45/300.14 # Propositional unsat core size : 0
% 0.45/300.14 # Propositional preprocessing time : 0.000
% 0.45/300.14 # Propositional encoding time : 0.000
% 0.45/300.14 # Propositional solver time : 0.000
% 0.45/300.14 # Success case prop preproc time : 0.000
% 0.45/300.14 # Success case prop encoding time : 0.000
% 0.45/300.14 # Success case prop solver time : 0.000
% 0.45/300.14 # Current number of processed clauses : 107
% 0.45/300.14 # Positive orientable unit clauses : 29
% 0.45/300.14 # Positive unorientable unit clauses: 0
% 0.45/300.14 # Negative unit clauses : 3
% 0.45/300.14 # Non-unit-clauses : 75
% 0.45/300.14 # Current number of unprocessed clauses: 17
% 0.45/300.14 # ...number of literals in the above : 137
% 0.45/300.14 # Current number of archived formulas : 0
% 0.45/300.14 # Current number of archived clauses : 39
% 0.45/300.14 # Clause-clause subsumption calls (NU) : 8738
% 0.45/300.14 # Rec. Clause-clause subsumption calls : 477
% 0.45/300.14 # Non-unit clause-clause subsumptions : 29
% 0.45/300.14 # Unit Clause-clause subsumption calls : 104
% 0.45/300.14 # Rewrite failures with RHS unbound : 0
% 0.45/300.14 # BW rewrite match attempts : 0
% 0.45/300.14 # BW rewrite match successes : 0
% 0.45/300.14 # Condensation attempts : 0
% 0.45/300.14 # Condensation successes : 0
% 0.45/300.14 # Termbank termtop insertions : 5956
% 0.45/300.14
% 0.45/300.14 # -------------------------------------------------
% 0.45/300.14 # User time : 0.012 s
% 0.45/300.14 # System time : 0.006 s
% 0.45/300.14 # Total time : 0.018 s
% 0.45/300.14 # Maximum resident set size: 1656 pages
% 0.45/300.14
% 0.45/300.14 # -------------------------------------------------
% 0.45/300.14 # User time : 0.061 s
% 0.45/300.14 # System time : 0.011 s
% 0.45/300.14 # Total time : 0.072 s
% 0.45/300.14 # Maximum resident set size: 1696 pages
% 0.45/300.14 % E---3.1 exiting
%------------------------------------------------------------------------------