TSTP Solution File: PLA022-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PLA022-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:09:53 EDT 2023
% Result : Unsatisfiable 0.77s 0.96s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 36 ( 16 unt; 0 nHn; 34 RR)
% Number of literals : 76 ( 0 equ; 48 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 : 52 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ACD,negated_conjecture,
~ holds(and(on(a,c),on(c,d)),X1),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',prove_ACD) ).
cnf(and_definition,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.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/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',putdown_2) ).
cnf(putdown_4,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.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/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',pickup_1) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',differ_a_table) ).
cnf(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',symmetry_of_differ) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',differ_a_c) ).
cnf(pickup_3,axiom,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',pickup_3) ).
cnf(pickup_4,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',pickup_4) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',initial_state3) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',initial_state5) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p',initial_state8) ).
cnf(c_0_14,negated_conjecture,
~ holds(and(on(a,c),on(c,d)),X1),
prove_ACD ).
cnf(c_0_15,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
and_definition ).
cnf(c_0_16,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(on(a,c),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_2 ).
cnf(c_0_18,negated_conjecture,
( ~ holds(on(c,d),do(putdown(a,c),X1))
| ~ holds(holding(a),X1)
| ~ holds(clear(c),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
putdown_4 ).
cnf(c_0_20,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(holding(a),X1)
| ~ holds(clear(c),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,c),
differ_a_c ).
cnf(c_0_25,negated_conjecture,
( ~ holds(on(c,d),do(pickup(a),X1))
| ~ holds(clear(c),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(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
pickup_3 ).
cnf(c_0_27,plain,
differ(c,a),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ holds(clear(c),do(pickup(a),X1))
| ~ holds(on(c,d),X1)
| ~ holds(clear(a),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(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
pickup_4 ).
cnf(c_0_30,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]) ).
cnf(c_0_31,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_32,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_33,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_34,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_35,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_30,c_0_31]),c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PLA022-2 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 20:36:45 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.QCprHRhNJZ/E---3.1_22718.p
% 0.77/0.96 # Version: 3.1pre001
% 0.77/0.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.77/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.77/0.96 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.96 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.96 # Starting sh5l with 300s (1) cores
% 0.77/0.96 # sh5l with pid 22799 completed with status 0
% 0.77/0.96 # Result found by sh5l
% 0.77/0.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.77/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.77/0.96 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.96 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.96 # Starting sh5l with 300s (1) cores
% 0.77/0.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.77/0.96 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.77/0.96 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.77/0.96 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.77/0.96 # SAT001_MinMin_p005000_rr_RG with pid 22806 completed with status 0
% 0.77/0.96 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.77/0.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.77/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.77/0.96 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.96 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.96 # Starting sh5l with 300s (1) cores
% 0.77/0.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.77/0.96 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.77/0.96 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.77/0.96 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.77/0.96 # Preprocessing time : 0.001 s
% 0.77/0.96 # Presaturation interreduction done
% 0.77/0.96
% 0.77/0.96 # Proof found!
% 0.77/0.96 # SZS status Unsatisfiable
% 0.77/0.96 # SZS output start CNFRefutation
% See solution above
% 0.77/0.96 # Parsed axioms : 31
% 0.77/0.96 # Removed by relevancy pruning/SinE : 0
% 0.77/0.96 # Initial clauses : 31
% 0.77/0.96 # Removed in clause preprocessing : 0
% 0.77/0.96 # Initial clauses in saturation : 31
% 0.77/0.96 # Processed clauses : 87
% 0.77/0.96 # ...of these trivial : 0
% 0.77/0.96 # ...subsumed : 3
% 0.77/0.96 # ...remaining for further processing : 84
% 0.77/0.96 # Other redundant clauses eliminated : 0
% 0.77/0.96 # Clauses deleted for lack of memory : 0
% 0.77/0.96 # Backward-subsumed : 0
% 0.77/0.96 # Backward-rewritten : 0
% 0.77/0.96 # Generated clauses : 43
% 0.77/0.96 # ...of the previous two non-redundant : 29
% 0.77/0.96 # ...aggressively subsumed : 0
% 0.77/0.96 # Contextual simplify-reflections : 0
% 0.77/0.96 # Paramodulations : 43
% 0.77/0.96 # Factorizations : 0
% 0.77/0.96 # NegExts : 0
% 0.77/0.96 # Equation resolutions : 0
% 0.77/0.96 # Total rewrite steps : 19
% 0.77/0.96 # Propositional unsat checks : 0
% 0.77/0.96 # Propositional check models : 0
% 0.77/0.96 # Propositional check unsatisfiable : 0
% 0.77/0.96 # Propositional clauses : 0
% 0.77/0.96 # Propositional clauses after purity: 0
% 0.77/0.96 # Propositional unsat core size : 0
% 0.77/0.96 # Propositional preprocessing time : 0.000
% 0.77/0.96 # Propositional encoding time : 0.000
% 0.77/0.96 # Propositional solver time : 0.000
% 0.77/0.96 # Success case prop preproc time : 0.000
% 0.77/0.96 # Success case prop encoding time : 0.000
% 0.77/0.96 # Success case prop solver time : 0.000
% 0.77/0.96 # Current number of processed clauses : 53
% 0.77/0.96 # Positive orientable unit clauses : 29
% 0.77/0.96 # Positive unorientable unit clauses: 0
% 0.77/0.96 # Negative unit clauses : 1
% 0.77/0.96 # Non-unit-clauses : 23
% 0.77/0.96 # Current number of unprocessed clauses: 4
% 0.77/0.96 # ...number of literals in the above : 18
% 0.77/0.96 # Current number of archived formulas : 0
% 0.77/0.96 # Current number of archived clauses : 31
% 0.77/0.96 # Clause-clause subsumption calls (NU) : 228
% 0.77/0.96 # Rec. Clause-clause subsumption calls : 87
% 0.77/0.96 # Non-unit clause-clause subsumptions : 3
% 0.77/0.96 # Unit Clause-clause subsumption calls : 0
% 0.77/0.96 # Rewrite failures with RHS unbound : 0
% 0.77/0.96 # BW rewrite match attempts : 0
% 0.77/0.96 # BW rewrite match successes : 0
% 0.77/0.96 # Condensation attempts : 0
% 0.77/0.96 # Condensation successes : 0
% 0.77/0.96 # Termbank termtop insertions : 1618
% 0.77/0.96
% 0.77/0.96 # -------------------------------------------------
% 0.77/0.96 # User time : 0.005 s
% 0.77/0.96 # System time : 0.001 s
% 0.77/0.96 # Total time : 0.006 s
% 0.77/0.96 # Maximum resident set size: 1628 pages
% 0.77/0.96
% 0.77/0.96 # -------------------------------------------------
% 0.77/0.96 # User time : 0.006 s
% 0.77/0.96 # System time : 0.002 s
% 0.77/0.96 # Total time : 0.009 s
% 0.77/0.96 # Maximum resident set size: 1696 pages
% 0.77/0.96 % E---3.1 exiting
% 0.77/0.96 % E---3.1 exiting
%------------------------------------------------------------------------------