TSTP Solution File: COL003-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL003-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Mon May 20 19:02:02 EDT 2024
% Result : Unsatisfiable 3.01s 0.87s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 14 unt; 0 nHn; 8 RR)
% Number of literals : 20 ( 13 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(w_definition,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_definition) ).
cnf(prove_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(b,apply(w,w)),apply(apply(b,w),apply(apply(b,b),b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
cnf(strong_fixed_point,axiom,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_5,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
w_definition ).
cnf(c_0_6,plain,
apply(apply(w,apply(b,X1)),X2) = apply(X1,apply(X2,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
~ fixed_point(apply(apply(b,apply(w,w)),apply(apply(b,w),apply(apply(b,b),b)))),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_8,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
inference(fof_simplification,[status(thm)],[strong_fixed_point]) ).
cnf(c_0_9,plain,
apply(apply(apply(w,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_10,plain,
apply(apply(w,w),X1) = apply(apply(X1,X1),X1),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
~ fixed_point(apply(apply(b,apply(w,w)),apply(apply(b,w),apply(apply(b,b),b)))),
c_0_7 ).
cnf(c_0_12,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
c_0_8 ).
cnf(c_0_13,plain,
apply(apply(w,apply(w,apply(b,apply(b,X1)))),X2) = apply(X1,apply(apply(w,w),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_5]) ).
cnf(c_0_14,negated_conjecture,
apply(fixed_pt,apply(apply(w,w),apply(w,apply(b,apply(b,fixed_pt))))) != apply(apply(w,w),apply(w,apply(b,apply(b,fixed_pt)))),
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_11,c_0_12]),c_0_4]),c_0_4]),c_0_4]),c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_15,plain,
apply(X1,apply(apply(w,w),apply(w,apply(b,apply(b,X1))))) = apply(apply(w,w),apply(w,apply(b,apply(b,X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL003-2 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 13:03:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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
% 3.01/0.87 # Version: 3.1.0
% 3.01/0.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.01/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.01/0.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.01/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.01/0.87 # Starting new_bool_1 with 300s (1) cores
% 3.01/0.87 # Starting sh5l with 300s (1) cores
% 3.01/0.87 # sh5l with pid 19312 completed with status 0
% 3.01/0.87 # Result found by sh5l
% 3.01/0.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.01/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.01/0.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.01/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.01/0.87 # Starting new_bool_1 with 300s (1) cores
% 3.01/0.87 # Starting sh5l with 300s (1) cores
% 3.01/0.87 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.01/0.87 # Search class: FHUSS-FFSF22-MFFFFFNN
% 3.01/0.87 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.01/0.87 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 3.01/0.87 # SAT001_MinMin_p005000_rr_RG with pid 19319 completed with status 0
% 3.01/0.87 # Result found by SAT001_MinMin_p005000_rr_RG
% 3.01/0.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.01/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.01/0.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.01/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.01/0.87 # Starting new_bool_1 with 300s (1) cores
% 3.01/0.87 # Starting sh5l with 300s (1) cores
% 3.01/0.87 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.01/0.87 # Search class: FHUSS-FFSF22-MFFFFFNN
% 3.01/0.87 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.01/0.87 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 3.01/0.87 # Preprocessing time : 0.001 s
% 3.01/0.87 # Presaturation interreduction done
% 3.01/0.87
% 3.01/0.87 # Proof found!
% 3.01/0.87 # SZS status Unsatisfiable
% 3.01/0.87 # SZS output start CNFRefutation
% See solution above
% 3.01/0.87 # Parsed axioms : 4
% 3.01/0.87 # Removed by relevancy pruning/SinE : 0
% 3.01/0.87 # Initial clauses : 4
% 3.01/0.87 # Removed in clause preprocessing : 0
% 3.01/0.87 # Initial clauses in saturation : 4
% 3.01/0.87 # Processed clauses : 535
% 3.01/0.87 # ...of these trivial : 175
% 3.01/0.87 # ...subsumed : 134
% 3.01/0.87 # ...remaining for further processing : 226
% 3.01/0.87 # Other redundant clauses eliminated : 0
% 3.01/0.87 # Clauses deleted for lack of memory : 0
% 3.01/0.87 # Backward-subsumed : 2
% 3.01/0.87 # Backward-rewritten : 23
% 3.01/0.87 # Generated clauses : 16033
% 3.01/0.87 # ...of the previous two non-redundant : 15598
% 3.01/0.87 # ...aggressively subsumed : 0
% 3.01/0.87 # Contextual simplify-reflections : 0
% 3.01/0.87 # Paramodulations : 16033
% 3.01/0.87 # Factorizations : 0
% 3.01/0.87 # NegExts : 0
% 3.01/0.87 # Equation resolutions : 0
% 3.01/0.87 # Disequality decompositions : 0
% 3.01/0.87 # Total rewrite steps : 5754
% 3.01/0.87 # ...of those cached : 3723
% 3.01/0.87 # Propositional unsat checks : 0
% 3.01/0.87 # Propositional check models : 0
% 3.01/0.87 # Propositional check unsatisfiable : 0
% 3.01/0.87 # Propositional clauses : 0
% 3.01/0.87 # Propositional clauses after purity: 0
% 3.01/0.87 # Propositional unsat core size : 0
% 3.01/0.87 # Propositional preprocessing time : 0.000
% 3.01/0.87 # Propositional encoding time : 0.000
% 3.01/0.87 # Propositional solver time : 0.000
% 3.01/0.87 # Success case prop preproc time : 0.000
% 3.01/0.87 # Success case prop encoding time : 0.000
% 3.01/0.87 # Success case prop solver time : 0.000
% 3.01/0.87 # Current number of processed clauses : 197
% 3.01/0.87 # Positive orientable unit clauses : 158
% 3.01/0.87 # Positive unorientable unit clauses: 37
% 3.01/0.87 # Negative unit clauses : 1
% 3.01/0.87 # Non-unit-clauses : 1
% 3.01/0.87 # Current number of unprocessed clauses: 15026
% 3.01/0.87 # ...number of literals in the above : 15026
% 3.01/0.87 # Current number of archived formulas : 0
% 3.01/0.87 # Current number of archived clauses : 29
% 3.01/0.87 # Clause-clause subsumption calls (NU) : 0
% 3.01/0.87 # Rec. Clause-clause subsumption calls : 0
% 3.01/0.87 # Non-unit clause-clause subsumptions : 0
% 3.01/0.87 # Unit Clause-clause subsumption calls : 2914
% 3.01/0.87 # Rewrite failures with RHS unbound : 0
% 3.01/0.87 # BW rewrite match attempts : 11618
% 3.01/0.87 # BW rewrite match successes : 339
% 3.01/0.87 # Condensation attempts : 0
% 3.01/0.87 # Condensation successes : 0
% 3.01/0.87 # Termbank termtop insertions : 554435
% 3.01/0.87 # Search garbage collected termcells : 5
% 3.01/0.87
% 3.01/0.87 # -------------------------------------------------
% 3.01/0.87 # User time : 0.335 s
% 3.01/0.87 # System time : 0.009 s
% 3.01/0.87 # Total time : 0.344 s
% 3.01/0.87 # Maximum resident set size: 1632 pages
% 3.01/0.87
% 3.01/0.87 # -------------------------------------------------
% 3.01/0.87 # User time : 0.335 s
% 3.01/0.87 # System time : 0.012 s
% 3.01/0.87 # Total time : 0.347 s
% 3.01/0.87 # Maximum resident set size: 1692 pages
% 3.01/0.87 % E---3.1 exiting
% 3.01/0.87 % E exiting
%------------------------------------------------------------------------------