TSTP Solution File: PLA002-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA002-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:04 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 10 unt; 2 nHn; 26 RR)
% Number of literals : 60 ( 0 equ; 34 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk_b_to_a,hypothesis,
( at(a,walk(a,X1))
| ~ at(b,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_b_to_a) ).
cnf(prove_you_can_get_to_a,negated_conjecture,
~ at(a,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_you_can_get_to_a) ).
cnf(cross_river_c_to_b,hypothesis,
( at(b,skate(b,X1))
| ~ cold(X1)
| ~ at(c,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cross_river_c_to_b) ).
cnf(warm_or_cold,hypothesis,
( warm(X1)
| cold(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',warm_or_cold) ).
cnf(go_d_to_c,hypothesis,
( at(c,go(c,X1))
| ~ at(d,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_d_to_c) ).
cnf(go_f_to_d,hypothesis,
( at(d,go(d,X1))
| ~ at(f,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_f_to_d) ).
cnf(climb_mountain_d_to_b,hypothesis,
( at(b,climb(b,X1))
| ~ warm(X1)
| ~ at(d,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
cnf(initial,hypothesis,
at(f,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial) ).
cnf(c_0_8,hypothesis,
( at(a,walk(a,X1))
| ~ at(b,X1) ),
inference(fof_simplification,[status(thm)],[walk_b_to_a]) ).
cnf(c_0_9,negated_conjecture,
~ at(a,X1),
inference(fof_simplification,[status(thm)],[prove_you_can_get_to_a]) ).
cnf(c_0_10,hypothesis,
( at(b,skate(b,X1))
| ~ cold(X1)
| ~ at(c,X1) ),
inference(fof_simplification,[status(thm)],[cross_river_c_to_b]) ).
cnf(c_0_11,hypothesis,
( at(a,walk(a,X1))
| ~ at(b,X1) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
~ at(a,X1),
c_0_9 ).
cnf(c_0_13,hypothesis,
( at(b,skate(b,X1))
| ~ cold(X1)
| ~ at(c,X1) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
~ at(b,X1),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
( ~ at(c,X1)
| ~ cold(X1) ),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,hypothesis,
( warm(X1)
| cold(X2) ),
warm_or_cold ).
cnf(c_0_17,hypothesis,
( at(c,go(c,X1))
| ~ at(d,X1) ),
inference(fof_simplification,[status(thm)],[go_d_to_c]) ).
cnf(c_0_18,hypothesis,
( warm(X1)
| ~ at(c,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
( at(c,go(c,X1))
| ~ at(d,X1) ),
c_0_17 ).
cnf(c_0_20,hypothesis,
( at(d,go(d,X1))
| ~ at(f,X1) ),
inference(fof_simplification,[status(thm)],[go_f_to_d]) ).
cnf(c_0_21,hypothesis,
( at(b,climb(b,X1))
| ~ warm(X1)
| ~ at(d,X1) ),
inference(fof_simplification,[status(thm)],[climb_mountain_d_to_b]) ).
cnf(c_0_22,hypothesis,
( warm(X1)
| ~ at(d,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
( at(d,go(d,X1))
| ~ at(f,X1) ),
c_0_20 ).
cnf(c_0_24,hypothesis,
( at(b,climb(b,X1))
| ~ warm(X1)
| ~ at(d,X1) ),
c_0_21 ).
cnf(c_0_25,hypothesis,
( warm(X1)
| ~ at(f,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,hypothesis,
at(f,s0),
initial ).
cnf(c_0_27,hypothesis,
( ~ at(d,X1)
| ~ warm(X1) ),
inference(sr,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_28,hypothesis,
warm(X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
~ at(d,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_30,hypothesis,
~ at(f,X1),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_26,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 13:29:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 1194 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 1199 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 17
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 17
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 17
% 0.19/0.49 # Processed clauses : 42
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 8
% 0.19/0.49 # ...remaining for further processing : 34
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 8
% 0.19/0.49 # Backward-rewritten : 5
% 0.19/0.49 # Generated clauses : 16
% 0.19/0.49 # ...of the previous two non-redundant : 16
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 15
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 5
% 0.19/0.49 # ...of those cached : 3
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 8
% 0.19/0.49 # Positive orientable unit clauses : 1
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 5
% 0.19/0.49 # Non-unit-clauses : 2
% 0.19/0.49 # Current number of unprocessed clauses: 2
% 0.19/0.49 # ...number of literals in the above : 3
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 26
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 69
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 69
% 0.19/0.49 # Non-unit clause-clause subsumptions : 3
% 0.19/0.49 # Unit Clause-clause subsumption calls : 15
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 2
% 0.19/0.49 # BW rewrite match successes : 2
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 706
% 0.19/0.49 # Search garbage collected termcells : 33
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.002 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.005 s
% 0.19/0.49 # Maximum resident set size: 1612 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.004 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.009 s
% 0.19/0.49 # Maximum resident set size: 1700 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------