TSTP Solution File: COL023-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL023-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:08 EDT 2024
% Result : Unsatisfiable 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 5 RR)
% Number of literals : 11 ( 10 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c_0_3,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_4,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_5,negated_conjecture,
X1 != apply(combinator,X1),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_6,plain,
apply(apply(apply(n,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X3,X2)),X3),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
X1 != apply(combinator,X1),
c_0_5 ).
cnf(c_0_8,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X3,X2),X3)),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(n,apply(b,apply(b,combinator))),X1),X2) != apply(apply(X2,X1),X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COL023-1 : TPTP v8.2.0. Released v1.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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:24:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/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.20/0.57 # Version: 3.1.0
% 0.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # sh5l with pid 6210 completed with status 0
% 0.20/0.57 # Result found by sh5l
% 0.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.57 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.20/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.20/0.57 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 6216 completed with status 0
% 0.20/0.57 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.57 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.20/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.20/0.57 # Preprocessing time : 0.001 s
% 0.20/0.57
% 0.20/0.57 # Proof found!
% 0.20/0.57 # SZS status Unsatisfiable
% 0.20/0.57 # SZS output start CNFRefutation
% See solution above
% 0.20/0.57 # Parsed axioms : 3
% 0.20/0.57 # Removed by relevancy pruning/SinE : 0
% 0.20/0.57 # Initial clauses : 3
% 0.20/0.57 # Removed in clause preprocessing : 0
% 0.20/0.57 # Initial clauses in saturation : 3
% 0.20/0.57 # Processed clauses : 162
% 0.20/0.57 # ...of these trivial : 20
% 0.20/0.57 # ...subsumed : 83
% 0.20/0.57 # ...remaining for further processing : 59
% 0.20/0.57 # Other redundant clauses eliminated : 0
% 0.20/0.57 # Clauses deleted for lack of memory : 0
% 0.20/0.57 # Backward-subsumed : 0
% 0.20/0.57 # Backward-rewritten : 0
% 0.20/0.57 # Generated clauses : 4063
% 0.20/0.57 # ...of the previous two non-redundant : 3942
% 0.20/0.57 # ...aggressively subsumed : 0
% 0.20/0.57 # Contextual simplify-reflections : 0
% 0.20/0.57 # Paramodulations : 4062
% 0.20/0.57 # Factorizations : 0
% 0.20/0.57 # NegExts : 0
% 0.20/0.57 # Equation resolutions : 1
% 0.20/0.57 # Disequality decompositions : 0
% 0.20/0.57 # Total rewrite steps : 715
% 0.20/0.57 # ...of those cached : 317
% 0.20/0.57 # Propositional unsat checks : 0
% 0.20/0.57 # Propositional check models : 0
% 0.20/0.57 # Propositional check unsatisfiable : 0
% 0.20/0.57 # Propositional clauses : 0
% 0.20/0.57 # Propositional clauses after purity: 0
% 0.20/0.57 # Propositional unsat core size : 0
% 0.20/0.57 # Propositional preprocessing time : 0.000
% 0.20/0.57 # Propositional encoding time : 0.000
% 0.20/0.57 # Propositional solver time : 0.000
% 0.20/0.57 # Success case prop preproc time : 0.000
% 0.20/0.57 # Success case prop encoding time : 0.000
% 0.20/0.57 # Success case prop solver time : 0.000
% 0.20/0.57 # Current number of processed clauses : 59
% 0.20/0.57 # Positive orientable unit clauses : 16
% 0.20/0.57 # Positive unorientable unit clauses: 21
% 0.20/0.57 # Negative unit clauses : 22
% 0.20/0.57 # Non-unit-clauses : 0
% 0.20/0.57 # Current number of unprocessed clauses: 3783
% 0.20/0.57 # ...number of literals in the above : 3783
% 0.20/0.57 # Current number of archived formulas : 0
% 0.20/0.57 # Current number of archived clauses : 0
% 0.20/0.57 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.57 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.57 # Non-unit clause-clause subsumptions : 0
% 0.20/0.57 # Unit Clause-clause subsumption calls : 126
% 0.20/0.57 # Rewrite failures with RHS unbound : 0
% 0.20/0.57 # BW rewrite match attempts : 913
% 0.20/0.57 # BW rewrite match successes : 5
% 0.20/0.57 # Condensation attempts : 0
% 0.20/0.57 # Condensation successes : 0
% 0.20/0.57 # Termbank termtop insertions : 119583
% 0.20/0.57 # Search garbage collected termcells : 2
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.085 s
% 0.20/0.57 # System time : 0.009 s
% 0.20/0.57 # Total time : 0.094 s
% 0.20/0.57 # Maximum resident set size: 1612 pages
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.086 s
% 0.20/0.57 # System time : 0.011 s
% 0.20/0.57 # Total time : 0.097 s
% 0.20/0.57 # Maximum resident set size: 1676 pages
% 0.20/0.57 % E---3.1 exiting
% 0.20/0.57 % E exiting
%------------------------------------------------------------------------------