TSTP Solution File: COL021-1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : COL021-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 Jun 24 04:45:29 EDT 2024
% Result : Unsatisfiable 1.18s 1.01s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 9 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox/tmp/tmp.mgkLKbxBVo/E---3.1_15533.p',prove_fixed_point) ).
cnf(m_definition,axiom,
apply(m,X1) = apply(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.mgkLKbxBVo/E---3.1_15533.p',m_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.mgkLKbxBVo/E---3.1_15533.p',b_definition) ).
cnf(c_0_3,negated_conjecture,
X1 != apply(combinator,X1),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_4,axiom,
apply(m,X1) = apply(X1,X1),
m_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,negated_conjecture,
X1 != apply(combinator,X1),
c_0_3 ).
cnf(c_0_7,plain,
apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
apply(m,apply(apply(b,combinator),X1)) != apply(X1,apply(apply(b,combinator),X1)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL021-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Jun 18 15:46:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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/tmp/tmp.mgkLKbxBVo/E---3.1_15533.p
% 1.18/1.01 # Version: 3.2.0
% 1.18/1.01 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.18/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/1.01 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.18/1.01 # Starting new_bool_3 with 300s (1) cores
% 1.18/1.01 # Starting new_bool_1 with 300s (1) cores
% 1.18/1.01 # Starting sh5l with 300s (1) cores
% 1.18/1.01 # sh5l with pid 15671 completed with status 0
% 1.18/1.01 # Result found by sh5l
% 1.18/1.01 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.18/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/1.01 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.18/1.01 # Starting new_bool_3 with 300s (1) cores
% 1.18/1.01 # Starting new_bool_1 with 300s (1) cores
% 1.18/1.01 # Starting sh5l with 300s (1) cores
% 1.18/1.01 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.18/1.01 # Search class: FUUPS-FFSF22-MFFFFFNN
% 1.18/1.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/1.01 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 1.18/1.01 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 15678 completed with status 0
% 1.18/1.01 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 1.18/1.01 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.18/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/1.01 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.18/1.01 # Starting new_bool_3 with 300s (1) cores
% 1.18/1.01 # Starting new_bool_1 with 300s (1) cores
% 1.18/1.01 # Starting sh5l with 300s (1) cores
% 1.18/1.01 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.18/1.01 # Search class: FUUPS-FFSF22-MFFFFFNN
% 1.18/1.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/1.01 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 1.18/1.01 # Preprocessing time : 0.001 s
% 1.18/1.01
% 1.18/1.01 # Proof found!
% 1.18/1.01 # SZS status Unsatisfiable
% 1.18/1.01 # SZS output start CNFRefutation
% See solution above
% 1.18/1.01 # Parsed axioms : 4
% 1.18/1.01 # Removed by relevancy pruning/SinE : 0
% 1.18/1.01 # Initial clauses : 4
% 1.18/1.01 # Removed in clause preprocessing : 0
% 1.18/1.01 # Initial clauses in saturation : 4
% 1.18/1.01 # Processed clauses : 8
% 1.18/1.01 # ...of these trivial : 0
% 1.18/1.01 # ...subsumed : 0
% 1.18/1.01 # ...remaining for further processing : 8
% 1.18/1.01 # Other redundant clauses eliminated : 0
% 1.18/1.01 # Clauses deleted for lack of memory : 0
% 1.18/1.01 # Backward-subsumed : 0
% 1.18/1.01 # Backward-rewritten : 0
% 1.18/1.01 # Generated clauses : 31
% 1.18/1.01 # ...of the previous two non-redundant : 25
% 1.18/1.01 # ...aggressively subsumed : 0
% 1.18/1.01 # Contextual simplify-reflections : 0
% 1.18/1.01 # Paramodulations : 30
% 1.18/1.01 # Factorizations : 0
% 1.18/1.01 # NegExts : 0
% 1.18/1.01 # Equation resolutions : 1
% 1.18/1.01 # Disequality decompositions : 0
% 1.18/1.01 # Total rewrite steps : 3
% 1.18/1.01 # ...of those cached : 0
% 1.18/1.01 # Propositional unsat checks : 0
% 1.18/1.01 # Propositional check models : 0
% 1.18/1.01 # Propositional check unsatisfiable : 0
% 1.18/1.01 # Propositional clauses : 0
% 1.18/1.01 # Propositional clauses after purity: 0
% 1.18/1.01 # Propositional unsat core size : 0
% 1.18/1.01 # Propositional preprocessing time : 0.000
% 1.18/1.01 # Propositional encoding time : 0.000
% 1.18/1.01 # Propositional solver time : 0.000
% 1.18/1.01 # Success case prop preproc time : 0.000
% 1.18/1.01 # Success case prop encoding time : 0.000
% 1.18/1.01 # Success case prop solver time : 0.000
% 1.18/1.01 # Current number of processed clauses : 8
% 1.18/1.01 # Positive orientable unit clauses : 4
% 1.18/1.01 # Positive unorientable unit clauses: 1
% 1.18/1.01 # Negative unit clauses : 3
% 1.18/1.01 # Non-unit-clauses : 0
% 1.18/1.01 # Current number of unprocessed clauses: 21
% 1.18/1.01 # ...number of literals in the above : 21
% 1.18/1.01 # Current number of archived formulas : 0
% 1.18/1.01 # Current number of archived clauses : 0
% 1.18/1.01 # Clause-clause subsumption calls (NU) : 0
% 1.18/1.01 # Rec. Clause-clause subsumption calls : 0
% 1.18/1.01 # Non-unit clause-clause subsumptions : 0
% 1.18/1.01 # Unit Clause-clause subsumption calls : 0
% 1.18/1.01 # Rewrite failures with RHS unbound : 0
% 1.18/1.01 # BW rewrite match attempts : 4
% 1.18/1.01 # BW rewrite match successes : 0
% 1.18/1.01 # Condensation attempts : 0
% 1.18/1.01 # Condensation successes : 0
% 1.18/1.01 # Termbank termtop insertions : 592
% 1.18/1.01 # Search garbage collected termcells : 2
% 1.18/1.01
% 1.18/1.01 # -------------------------------------------------
% 1.18/1.01 # User time : 0.003 s
% 1.18/1.01 # System time : 0.002 s
% 1.18/1.01 # Total time : 0.004 s
% 1.18/1.01 # Maximum resident set size: 1612 pages
% 1.18/1.01
% 1.18/1.01 # -------------------------------------------------
% 1.18/1.01 # User time : 0.003 s
% 1.18/1.01 # System time : 0.004 s
% 1.18/1.01 # Total time : 0.007 s
% 1.18/1.01 # Maximum resident set size: 1684 pages
% 1.18/1.01 % E---3.1 exiting
% 1.18/1.02 % E exiting
%------------------------------------------------------------------------------