TSTP Solution File: COL003-14 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL003-14 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:27:54 EDT 2024
% Result : Unsatisfiable 0.64s 0.59s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 15 equ; 3 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(w_definition,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.IOsOfes2nw/E---3.1_32178.p',w_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.IOsOfes2nw/E---3.1_32178.p',b_definition) ).
cnf(strong_fixed_point,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(w,w)),apply(apply(b,w),b))),b),
file('/export/starexec/sandbox2/tmp/tmp.IOsOfes2nw/E---3.1_32178.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/sandbox2/tmp/tmp.IOsOfes2nw/E---3.1_32178.p',prove_strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
w_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_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,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_5,c_0_6]) ).
cnf(c_0_8,plain,
apply(apply(w,w),X1) = apply(apply(X1,X1),X1),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_9,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(w,w)),apply(apply(b,w),b))),b),
strong_fixed_point ).
cnf(c_0_10,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_11,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_7,c_0_8]),c_0_4]) ).
cnf(c_0_12,plain,
apply(apply(w,w),apply(w,apply(b,apply(b,X1)))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_5]),c_0_5]) ).
cnf(c_0_13,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
c_0_10 ).
cnf(c_0_14,plain,
apply(X1,apply(strong_fixed_point,X1)) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_12]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COL003-14 : TPTP v8.1.2. Released v2.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 11:30:33 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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/tmp/tmp.IOsOfes2nw/E---3.1_32178.p
% 0.64/0.59 # Version: 3.1.0
% 0.64/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.59 # Starting sh5l with 300s (1) cores
% 0.64/0.59 # new_bool_3 with pid 32296 completed with status 0
% 0.64/0.59 # Result found by new_bool_3
% 0.64/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.59 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.64/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.59 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.64/0.59 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 32305 completed with status 0
% 0.64/0.59 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.64/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.59 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.64/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.59 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.64/0.59 # Preprocessing time : 0.001 s
% 0.64/0.59
% 0.64/0.59 # Proof found!
% 0.64/0.59 # SZS status Unsatisfiable
% 0.64/0.59 # SZS output start CNFRefutation
% See solution above
% 0.64/0.59 # Parsed axioms : 4
% 0.64/0.59 # Removed by relevancy pruning/SinE : 0
% 0.64/0.59 # Initial clauses : 4
% 0.64/0.59 # Removed in clause preprocessing : 0
% 0.64/0.59 # Initial clauses in saturation : 4
% 0.64/0.59 # Processed clauses : 148
% 0.64/0.59 # ...of these trivial : 39
% 0.64/0.59 # ...subsumed : 55
% 0.64/0.59 # ...remaining for further processing : 54
% 0.64/0.59 # Other redundant clauses eliminated : 0
% 0.64/0.59 # Clauses deleted for lack of memory : 0
% 0.64/0.59 # Backward-subsumed : 0
% 0.64/0.59 # Backward-rewritten : 6
% 0.64/0.59 # Generated clauses : 2600
% 0.64/0.59 # ...of the previous two non-redundant : 2488
% 0.64/0.59 # ...aggressively subsumed : 0
% 0.64/0.59 # Contextual simplify-reflections : 0
% 0.64/0.59 # Paramodulations : 2600
% 0.64/0.59 # Factorizations : 0
% 0.64/0.59 # NegExts : 0
% 0.64/0.59 # Equation resolutions : 0
% 0.64/0.59 # Disequality decompositions : 0
% 0.64/0.59 # Total rewrite steps : 851
% 0.64/0.59 # ...of those cached : 441
% 0.64/0.59 # Propositional unsat checks : 0
% 0.64/0.59 # Propositional check models : 0
% 0.64/0.59 # Propositional check unsatisfiable : 0
% 0.64/0.59 # Propositional clauses : 0
% 0.64/0.59 # Propositional clauses after purity: 0
% 0.64/0.59 # Propositional unsat core size : 0
% 0.64/0.59 # Propositional preprocessing time : 0.000
% 0.64/0.59 # Propositional encoding time : 0.000
% 0.64/0.59 # Propositional solver time : 0.000
% 0.64/0.59 # Success case prop preproc time : 0.000
% 0.64/0.59 # Success case prop encoding time : 0.000
% 0.64/0.59 # Success case prop solver time : 0.000
% 0.64/0.59 # Current number of processed clauses : 48
% 0.64/0.59 # Positive orientable unit clauses : 32
% 0.64/0.59 # Positive unorientable unit clauses: 16
% 0.64/0.59 # Negative unit clauses : 0
% 0.64/0.59 # Non-unit-clauses : 0
% 0.64/0.59 # Current number of unprocessed clauses: 2337
% 0.64/0.59 # ...number of literals in the above : 2337
% 0.64/0.59 # Current number of archived formulas : 0
% 0.64/0.59 # Current number of archived clauses : 6
% 0.64/0.59 # Clause-clause subsumption calls (NU) : 0
% 0.64/0.59 # Rec. Clause-clause subsumption calls : 0
% 0.64/0.59 # Non-unit clause-clause subsumptions : 0
% 0.64/0.59 # Unit Clause-clause subsumption calls : 77
% 0.64/0.59 # Rewrite failures with RHS unbound : 0
% 0.64/0.59 # BW rewrite match attempts : 962
% 0.64/0.59 # BW rewrite match successes : 29
% 0.64/0.59 # Condensation attempts : 0
% 0.64/0.59 # Condensation successes : 0
% 0.64/0.59 # Termbank termtop insertions : 68129
% 0.64/0.59 # Search garbage collected termcells : 2
% 0.64/0.59
% 0.64/0.59 # -------------------------------------------------
% 0.64/0.59 # User time : 0.052 s
% 0.64/0.59 # System time : 0.003 s
% 0.64/0.59 # Total time : 0.055 s
% 0.64/0.59 # Maximum resident set size: 1620 pages
% 0.64/0.59
% 0.64/0.59 # -------------------------------------------------
% 0.64/0.59 # User time : 0.053 s
% 0.64/0.59 # System time : 0.005 s
% 0.64/0.59 # Total time : 0.058 s
% 0.64/0.59 # Maximum resident set size: 1684 pages
% 0.64/0.59 % E---3.1 exiting
% 0.64/0.59 % E exiting
%------------------------------------------------------------------------------