TSTP Solution File: PLA017-10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA017-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:09 EDT 2024
% Result : Unsatisfiable 0.38s 0.72s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 17 RR)
% Number of literals : 29 ( 28 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(pickup_1,axiom,
ifeq(differ(X1,table),true,ifeq(holds(empty,X2),true,ifeq(holds(clear(X1),X2),true,holds(holding(X1),do(pickup(X1),X2)),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pickup_1) ).
cnf(initial_state5,axiom,
holds(clear(a),s0) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_state5) ).
cnf(differ_a_table,axiom,
differ(a,table) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',differ_a_table) ).
cnf(initial_state8,axiom,
holds(empty,s0) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_state8) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(pickup_4,axiom,
ifeq(differ(X1,X2),true,ifeq(holds(clear(X1),X3),true,holds(clear(X1),do(pickup(X2),X3)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pickup_4) ).
cnf(initial_state7,axiom,
holds(clear(c),s0) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_state7) ).
cnf(symmetry_of_differ,axiom,
ifeq(differ(X1,X2),true,differ(X2,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_differ) ).
cnf(differ_a_c,axiom,
differ(a,c) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',differ_a_c) ).
cnf(putdown_2,axiom,
ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(on(X1,X3),do(putdown(X1,X3),X2)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',putdown_2) ).
cnf(prove_AC,negated_conjecture,
holds(on(a,c),X1) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_AC) ).
cnf(c_0_11,axiom,
ifeq(differ(X1,table),true,ifeq(holds(empty,X2),true,ifeq(holds(clear(X1),X2),true,holds(holding(X1),do(pickup(X1),X2)),true),true),true) = true,
pickup_1 ).
cnf(c_0_12,axiom,
holds(clear(a),s0) = true,
initial_state5 ).
cnf(c_0_13,axiom,
differ(a,table) = true,
differ_a_table ).
cnf(c_0_14,axiom,
holds(empty,s0) = true,
initial_state8 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
ifeq(differ(X1,X2),true,ifeq(holds(clear(X1),X3),true,holds(clear(X1),do(pickup(X2),X3)),true),true) = true,
pickup_4 ).
cnf(c_0_17,axiom,
holds(clear(c),s0) = true,
initial_state7 ).
cnf(c_0_18,axiom,
ifeq(differ(X1,X2),true,differ(X2,X1),true) = true,
symmetry_of_differ ).
cnf(c_0_19,axiom,
differ(a,c) = true,
differ_a_c ).
cnf(c_0_20,axiom,
ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(on(X1,X3),do(putdown(X1,X3),X2)),true),true) = true,
putdown_2 ).
cnf(c_0_21,plain,
holds(holding(a),do(pickup(a),s0)) = true,
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_11,c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_22,plain,
ifeq(differ(c,X1),true,holds(clear(c),do(pickup(X1),s0)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_23,plain,
differ(c,a) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
cnf(c_0_24,negated_conjecture,
holds(on(a,c),X1) != true,
inference(fof_simplification,[status(thm)],[prove_AC]) ).
cnf(c_0_25,plain,
ifeq(holds(clear(X1),do(pickup(a),s0)),true,holds(on(a,X1),do(putdown(a,X1),do(pickup(a),s0))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_26,plain,
holds(clear(c),do(pickup(a),s0)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).
cnf(c_0_27,negated_conjecture,
holds(on(a,c),X1) != true,
c_0_24 ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_15]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PLA017-10 : TPTP v8.2.0. Released v7.3.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 13:42:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.38/0.72 # Version: 3.1.0
% 0.38/0.72 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.38/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.38/0.72 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.72 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.72 # Starting sh5l with 300s (1) cores
% 0.38/0.72 # sh5l with pid 17529 completed with status 0
% 0.38/0.72 # Result found by sh5l
% 0.38/0.72 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.38/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.38/0.72 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.72 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.72 # Starting sh5l with 300s (1) cores
% 0.38/0.72 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.38/0.72 # Search class: FUUPM-FFMM31-DFFFFFNN
% 0.38/0.72 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.72 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 75s (1) cores
% 0.38/0.72 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17537 completed with status 0
% 0.38/0.72 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.72 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.38/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.38/0.72 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.72 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.72 # Starting sh5l with 300s (1) cores
% 0.38/0.72 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.38/0.72 # Search class: FUUPM-FFMM31-DFFFFFNN
% 0.38/0.72 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.72 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 75s (1) cores
% 0.38/0.72 # Preprocessing time : 0.001 s
% 0.38/0.72 # Presaturation interreduction done
% 0.38/0.72
% 0.38/0.72 # Proof found!
% 0.38/0.72 # SZS status Unsatisfiable
% 0.38/0.72 # SZS output start CNFRefutation
% See solution above
% 0.38/0.72 # Parsed axioms : 32
% 0.38/0.72 # Removed by relevancy pruning/SinE : 1
% 0.38/0.72 # Initial clauses : 31
% 0.38/0.72 # Removed in clause preprocessing : 0
% 0.38/0.72 # Initial clauses in saturation : 31
% 0.38/0.72 # Processed clauses : 952
% 0.38/0.72 # ...of these trivial : 78
% 0.38/0.72 # ...subsumed : 0
% 0.38/0.72 # ...remaining for further processing : 874
% 0.38/0.72 # Other redundant clauses eliminated : 0
% 0.38/0.72 # Clauses deleted for lack of memory : 0
% 0.38/0.72 # Backward-subsumed : 0
% 0.38/0.72 # Backward-rewritten : 1
% 0.38/0.72 # Generated clauses : 9758
% 0.38/0.72 # ...of the previous two non-redundant : 7941
% 0.38/0.72 # ...aggressively subsumed : 0
% 0.38/0.72 # Contextual simplify-reflections : 0
% 0.38/0.72 # Paramodulations : 9758
% 0.38/0.72 # Factorizations : 0
% 0.38/0.72 # NegExts : 0
% 0.38/0.72 # Equation resolutions : 0
% 0.38/0.72 # Disequality decompositions : 0
% 0.38/0.72 # Total rewrite steps : 14373
% 0.38/0.72 # ...of those cached : 6472
% 0.38/0.72 # Propositional unsat checks : 0
% 0.38/0.72 # Propositional check models : 0
% 0.38/0.72 # Propositional check unsatisfiable : 0
% 0.38/0.72 # Propositional clauses : 0
% 0.38/0.72 # Propositional clauses after purity: 0
% 0.38/0.72 # Propositional unsat core size : 0
% 0.38/0.72 # Propositional preprocessing time : 0.000
% 0.38/0.72 # Propositional encoding time : 0.000
% 0.38/0.72 # Propositional solver time : 0.000
% 0.38/0.72 # Success case prop preproc time : 0.000
% 0.38/0.72 # Success case prop encoding time : 0.000
% 0.38/0.72 # Success case prop solver time : 0.000
% 0.38/0.72 # Current number of processed clauses : 842
% 0.38/0.72 # Positive orientable unit clauses : 841
% 0.38/0.72 # Positive unorientable unit clauses: 0
% 0.38/0.72 # Negative unit clauses : 1
% 0.38/0.72 # Non-unit-clauses : 0
% 0.38/0.72 # Current number of unprocessed clauses: 7051
% 0.38/0.72 # ...number of literals in the above : 7051
% 0.38/0.72 # Current number of archived formulas : 0
% 0.38/0.72 # Current number of archived clauses : 32
% 0.38/0.72 # Clause-clause subsumption calls (NU) : 0
% 0.38/0.72 # Rec. Clause-clause subsumption calls : 0
% 0.38/0.72 # Non-unit clause-clause subsumptions : 0
% 0.38/0.72 # Unit Clause-clause subsumption calls : 0
% 0.38/0.72 # Rewrite failures with RHS unbound : 0
% 0.38/0.72 # BW rewrite match attempts : 18573
% 0.38/0.72 # BW rewrite match successes : 1
% 0.38/0.72 # Condensation attempts : 0
% 0.38/0.72 # Condensation successes : 0
% 0.38/0.72 # Termbank termtop insertions : 247397
% 0.38/0.72 # Search garbage collected termcells : 9
% 0.38/0.72
% 0.38/0.72 # -------------------------------------------------
% 0.38/0.72 # User time : 0.158 s
% 0.38/0.72 # System time : 0.016 s
% 0.38/0.72 # Total time : 0.174 s
% 0.38/0.72 # Maximum resident set size: 1648 pages
% 0.38/0.72
% 0.38/0.72 # -------------------------------------------------
% 0.38/0.72 # User time : 0.161 s
% 0.38/0.72 # System time : 0.016 s
% 0.38/0.72 # Total time : 0.177 s
% 0.38/0.72 # Maximum resident set size: 1712 pages
% 0.38/0.72 % E---3.1 exiting
% 0.38/0.72 % E exiting
%------------------------------------------------------------------------------