TSTP Solution File: COL001-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL001-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:01:58 EDT 2024
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 12 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(s_definition,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_definition) ).
cnf(i_definition,axiom,
apply(i,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i_definition) ).
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
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(c_0_4,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
s_definition ).
cnf(c_0_5,axiom,
apply(i,X1) = X1,
i_definition ).
cnf(c_0_6,negated_conjecture,
X1 != apply(combinator,X1),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_7,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_8,plain,
apply(apply(apply(s,X1),i),X2) = apply(apply(X1,X2),X2),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
X1 != apply(combinator,X1),
c_0_6 ).
cnf(c_0_10,plain,
apply(apply(apply(s,apply(b,X1)),i),X2) = apply(X1,apply(X2,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
apply(apply(apply(s,apply(b,combinator)),i),X1) != apply(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : COL001-2 : TPTP v8.2.0. Released v1.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n023.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 : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat May 18 13:12:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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.19/0.47 # Version: 3.1.0
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # sh5l with pid 24158 completed with status 0
% 0.19/0.47 # Result found by sh5l
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.47 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.19/0.47 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.19/0.47 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 24160 completed with status 0
% 0.19/0.47 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.47 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.19/0.47 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Unsatisfiable
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 6
% 0.19/0.47 # Removed by relevancy pruning/SinE : 1
% 0.19/0.47 # Initial clauses : 5
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 5
% 0.19/0.47 # Processed clauses : 39
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 16
% 0.19/0.47 # ...remaining for further processing : 23
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 1
% 0.19/0.47 # Generated clauses : 440
% 0.19/0.47 # ...of the previous two non-redundant : 414
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 439
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 1
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 82
% 0.19/0.47 # ...of those cached : 45
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 17
% 0.19/0.47 # Positive orientable unit clauses : 8
% 0.19/0.47 # Positive unorientable unit clauses: 7
% 0.19/0.47 # Negative unit clauses : 2
% 0.19/0.47 # Non-unit-clauses : 0
% 0.19/0.47 # Current number of unprocessed clauses: 385
% 0.19/0.47 # ...number of literals in the above : 385
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 6
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 9
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 123
% 0.19/0.47 # BW rewrite match successes : 7
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 8975
% 0.19/0.47 # Search garbage collected termcells : 6
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.010 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.011 s
% 0.19/0.47 # Maximum resident set size: 1620 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.011 s
% 0.19/0.47 # System time : 0.004 s
% 0.19/0.47 # Total time : 0.015 s
% 0.19/0.47 # Maximum resident set size: 1692 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------