TSTP Solution File: COL044-8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL044-8 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Sat May 4 07:28:06 EDT 2024
% Result : Unsatisfiable 3.80s 0.95s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 23 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox/tmp/tmp.Kn6xBRQ9hI/E---3.1_27542.p',n_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.Kn6xBRQ9hI/E---3.1_27542.p',b_definition) ).
cnf(strong_fixed_point,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),
file('/export/starexec/sandbox/tmp/tmp.Kn6xBRQ9hI/E---3.1_27542.p',strong_fixed_point) ).
cnf(prove_strong_fixed_point,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file('/export/starexec/sandbox/tmp/tmp.Kn6xBRQ9hI/E---3.1_27542.p',prove_strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),
strong_fixed_point ).
cnf(c_0_7,plain,
apply(apply(apply(n,apply(X1,X2)),X2),X3) = apply(apply(apply(n,apply(n,X1)),X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_8,plain,
apply(apply(apply(n,apply(apply(b,X1),X2)),X3),X4) = apply(apply(apply(X1,apply(X2,X4)),X3),X4),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,plain,
apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n),apply(b,apply(b,X1))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_10,plain,
apply(apply(apply(n,apply(X1,apply(X2,X3))),X3),X4) = apply(apply(apply(n,apply(n,apply(apply(b,X1),X2))),X3),X4),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_11,plain,
apply(apply(apply(n,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X3,X2)),X3),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_12,plain,
apply(apply(apply(n,apply(apply(b,b),X1)),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_13,plain,
apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n),apply(b,apply(b,X1))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
apply(apply(apply(apply(n,apply(b,b)),X1),X2),X3) = apply(apply(X2,X1),apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,X1))),apply(n,apply(b,apply(b,X1)))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_7]) ).
cnf(c_0_16,plain,
apply(apply(apply(n,apply(n,apply(b,b))),X1),X2) = apply(apply(X1,X2),apply(X1,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_17,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_5,c_0_11]) ).
cnf(c_0_18,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),apply(n,apply(b,apply(b,X1)))),apply(n,apply(b,apply(b,X1)))) = apply(strong_fixed_point,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_20,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),apply(n,apply(b,apply(b,X2)))),apply(n,apply(b,apply(b,X2)))) = apply(X1,apply(strong_fixed_point,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
c_0_19 ).
cnf(c_0_22,plain,
apply(X1,apply(strong_fixed_point,X1)) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : COL044-8 : TPTP v8.1.2. Released v2.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 12:01:36 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.Kn6xBRQ9hI/E---3.1_27542.p
% 3.80/0.95 # Version: 3.1.0
% 3.80/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.80/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.80/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.80/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.80/0.95 # Starting new_bool_1 with 300s (1) cores
% 3.80/0.95 # Starting sh5l with 300s (1) cores
% 3.80/0.95 # new_bool_3 with pid 27655 completed with status 0
% 3.80/0.95 # Result found by new_bool_3
% 3.80/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.80/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.80/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.80/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.80/0.95 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.80/0.95 # Search class: FUUPS-FFSF22-DFFFFFNN
% 3.80/0.95 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.80/0.95 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 3.80/0.95 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 27660 completed with status 0
% 3.80/0.95 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 3.80/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.80/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.80/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.80/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.80/0.95 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.80/0.95 # Search class: FUUPS-FFSF22-DFFFFFNN
% 3.80/0.95 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.80/0.95 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 3.80/0.95 # Preprocessing time : 0.001 s
% 3.80/0.95 # Presaturation interreduction done
% 3.80/0.95
% 3.80/0.95 # Proof found!
% 3.80/0.95 # SZS status Unsatisfiable
% 3.80/0.95 # SZS output start CNFRefutation
% See solution above
% 3.80/0.95 # Parsed axioms : 4
% 3.80/0.95 # Removed by relevancy pruning/SinE : 0
% 3.80/0.95 # Initial clauses : 4
% 3.80/0.95 # Removed in clause preprocessing : 0
% 3.80/0.95 # Initial clauses in saturation : 4
% 3.80/0.95 # Processed clauses : 395
% 3.80/0.95 # ...of these trivial : 106
% 3.80/0.95 # ...subsumed : 148
% 3.80/0.95 # ...remaining for further processing : 141
% 3.80/0.95 # Other redundant clauses eliminated : 0
% 3.80/0.95 # Clauses deleted for lack of memory : 0
% 3.80/0.95 # Backward-subsumed : 0
% 3.80/0.95 # Backward-rewritten : 11
% 3.80/0.95 # Generated clauses : 27150
% 3.80/0.95 # ...of the previous two non-redundant : 26661
% 3.80/0.95 # ...aggressively subsumed : 0
% 3.80/0.95 # Contextual simplify-reflections : 0
% 3.80/0.95 # Paramodulations : 27150
% 3.80/0.95 # Factorizations : 0
% 3.80/0.95 # NegExts : 0
% 3.80/0.95 # Equation resolutions : 0
% 3.80/0.95 # Disequality decompositions : 0
% 3.80/0.95 # Total rewrite steps : 5872
% 3.80/0.95 # ...of those cached : 1648
% 3.80/0.95 # Propositional unsat checks : 0
% 3.80/0.95 # Propositional check models : 0
% 3.80/0.95 # Propositional check unsatisfiable : 0
% 3.80/0.95 # Propositional clauses : 0
% 3.80/0.95 # Propositional clauses after purity: 0
% 3.80/0.95 # Propositional unsat core size : 0
% 3.80/0.95 # Propositional preprocessing time : 0.000
% 3.80/0.95 # Propositional encoding time : 0.000
% 3.80/0.95 # Propositional solver time : 0.000
% 3.80/0.95 # Success case prop preproc time : 0.000
% 3.80/0.95 # Success case prop encoding time : 0.000
% 3.80/0.95 # Success case prop solver time : 0.000
% 3.80/0.95 # Current number of processed clauses : 126
% 3.80/0.95 # Positive orientable unit clauses : 70
% 3.80/0.95 # Positive unorientable unit clauses: 56
% 3.80/0.95 # Negative unit clauses : 0
% 3.80/0.95 # Non-unit-clauses : 0
% 3.80/0.95 # Current number of unprocessed clauses: 26267
% 3.80/0.95 # ...number of literals in the above : 26267
% 3.80/0.95 # Current number of archived formulas : 0
% 3.80/0.95 # Current number of archived clauses : 15
% 3.80/0.95 # Clause-clause subsumption calls (NU) : 0
% 3.80/0.95 # Rec. Clause-clause subsumption calls : 0
% 3.80/0.95 # Non-unit clause-clause subsumptions : 0
% 3.80/0.95 # Unit Clause-clause subsumption calls : 831
% 3.80/0.95 # Rewrite failures with RHS unbound : 0
% 3.80/0.95 # BW rewrite match attempts : 9435
% 3.80/0.95 # BW rewrite match successes : 70
% 3.80/0.95 # Condensation attempts : 0
% 3.80/0.95 # Condensation successes : 0
% 3.80/0.95 # Termbank termtop insertions : 923464
% 3.80/0.95 # Search garbage collected termcells : 2
% 3.80/0.95
% 3.80/0.95 # -------------------------------------------------
% 3.80/0.95 # User time : 0.409 s
% 3.80/0.95 # System time : 0.029 s
% 3.80/0.95 # Total time : 0.438 s
% 3.80/0.95 # Maximum resident set size: 1620 pages
% 3.80/0.95
% 3.80/0.95 # -------------------------------------------------
% 3.80/0.95 # User time : 0.410 s
% 3.80/0.95 # System time : 0.031 s
% 3.80/0.95 # Total time : 0.441 s
% 3.80/0.95 # Maximum resident set size: 1692 pages
% 3.80/0.95 % E---3.1 exiting
% 3.80/0.95 % E exiting
%------------------------------------------------------------------------------