TSTP Solution File: COL043-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL043-2 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:43 EDT 2024
% Result : Unsatisfiable 1.83s 0.69s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 21 ( 14 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)),
file('/export/starexec/sandbox/tmp/tmp.r2MD4Kwhi1/E---3.1_27193.p',prove_strong_fixed_point) ).
cnf(strong_fixed_point,axiom,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
file('/export/starexec/sandbox/tmp/tmp.r2MD4Kwhi1/E---3.1_27193.p',strong_fixed_point) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.r2MD4Kwhi1/E---3.1_27193.p',b_definition) ).
cnf(h_definition,axiom,
apply(apply(apply(h,X1),X2),X3) = apply(apply(apply(X1,X2),X3),X2),
file('/export/starexec/sandbox/tmp/tmp.r2MD4Kwhi1/E---3.1_27193.p',h_definition) ).
cnf(c_0_4,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_5,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
inference(fof_simplification,[status(thm)],[strong_fixed_point]) ).
cnf(c_0_6,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)),
c_0_4 ).
cnf(c_0_7,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
c_0_5 ).
cnf(c_0_8,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_9,axiom,
apply(apply(apply(h,X1),X2),X3) = apply(apply(apply(X1,X2),X3),X2),
h_definition ).
cnf(c_0_10,negated_conjecture,
apply(fixed_pt,apply(apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h),apply(b,apply(b,fixed_pt)))) != apply(apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h),apply(b,apply(b,fixed_pt))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
apply(apply(apply(h,apply(apply(b,X1),X2)),X3),X4) = apply(apply(apply(X1,apply(X2,X3)),X4),X3),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
apply(fixed_pt,apply(apply(apply(h,apply(apply(b,b),apply(apply(h,apply(apply(b,h),apply(b,b))),h))),apply(b,apply(b,fixed_pt))),h)) != apply(apply(apply(h,apply(apply(b,b),apply(apply(h,apply(apply(b,h),apply(b,b))),h))),apply(b,apply(b,fixed_pt))),h),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_8]),c_0_11]),c_0_8]) ).
cnf(c_0_13,plain,
apply(apply(apply(h,apply(apply(b,b),X1)),X2),X3) = apply(apply(X1,X2),apply(X3,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,plain,
apply(apply(apply(h,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X2,X3)),X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
apply(fixed_pt,apply(apply(apply(h,apply(b,apply(b,fixed_pt))),apply(h,apply(b,apply(b,fixed_pt)))),apply(h,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(h,apply(b,apply(b,fixed_pt))),apply(h,apply(b,apply(b,fixed_pt)))),apply(h,apply(b,apply(b,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_11]),c_0_13]),c_0_13]),c_0_11]),c_0_13]) ).
cnf(c_0_16,plain,
apply(apply(apply(h,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X3),X2)),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL043-2 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.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 : Fri May 3 11:11:51 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.r2MD4Kwhi1/E---3.1_27193.p
% 1.83/0.69 # Version: 3.1.0
% 1.83/0.69 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.83/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.69 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.83/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.83/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.83/0.69 # Starting sh5l with 300s (1) cores
% 1.83/0.69 # sh5l with pid 27274 completed with status 0
% 1.83/0.69 # Result found by sh5l
% 1.83/0.69 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.83/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.69 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.83/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.83/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.83/0.69 # Starting sh5l with 300s (1) cores
% 1.83/0.69 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.83/0.69 # Search class: FHUSS-FFSF22-DFFFFFNN
% 1.83/0.69 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.69 # Starting SAT001_MinMin_p005000_rr_RG with 163s (1) cores
% 1.83/0.69 # SAT001_MinMin_p005000_rr_RG with pid 27281 completed with status 0
% 1.83/0.69 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.83/0.69 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.83/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.69 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.83/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.83/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.83/0.69 # Starting sh5l with 300s (1) cores
% 1.83/0.69 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.83/0.69 # Search class: FHUSS-FFSF22-DFFFFFNN
% 1.83/0.69 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.69 # Starting SAT001_MinMin_p005000_rr_RG with 163s (1) cores
% 1.83/0.69 # Preprocessing time : 0.001 s
% 1.83/0.69 # Presaturation interreduction done
% 1.83/0.69
% 1.83/0.69 # Proof found!
% 1.83/0.69 # SZS status Unsatisfiable
% 1.83/0.69 # SZS output start CNFRefutation
% See solution above
% 1.83/0.69 # Parsed axioms : 4
% 1.83/0.69 # Removed by relevancy pruning/SinE : 0
% 1.83/0.69 # Initial clauses : 4
% 1.83/0.69 # Removed in clause preprocessing : 0
% 1.83/0.69 # Initial clauses in saturation : 4
% 1.83/0.69 # Processed clauses : 371
% 1.83/0.69 # ...of these trivial : 124
% 1.83/0.69 # ...subsumed : 49
% 1.83/0.69 # ...remaining for further processing : 198
% 1.83/0.69 # Other redundant clauses eliminated : 0
% 1.83/0.69 # Clauses deleted for lack of memory : 0
% 1.83/0.69 # Backward-subsumed : 0
% 1.83/0.69 # Backward-rewritten : 33
% 1.83/0.69 # Generated clauses : 13008
% 1.83/0.69 # ...of the previous two non-redundant : 12340
% 1.83/0.69 # ...aggressively subsumed : 0
% 1.83/0.69 # Contextual simplify-reflections : 0
% 1.83/0.69 # Paramodulations : 13008
% 1.83/0.69 # Factorizations : 0
% 1.83/0.69 # NegExts : 0
% 1.83/0.69 # Equation resolutions : 0
% 1.83/0.69 # Disequality decompositions : 0
% 1.83/0.69 # Total rewrite steps : 3736
% 1.83/0.69 # ...of those cached : 2166
% 1.83/0.69 # Propositional unsat checks : 0
% 1.83/0.69 # Propositional check models : 0
% 1.83/0.69 # Propositional check unsatisfiable : 0
% 1.83/0.69 # Propositional clauses : 0
% 1.83/0.69 # Propositional clauses after purity: 0
% 1.83/0.69 # Propositional unsat core size : 0
% 1.83/0.69 # Propositional preprocessing time : 0.000
% 1.83/0.69 # Propositional encoding time : 0.000
% 1.83/0.69 # Propositional solver time : 0.000
% 1.83/0.69 # Success case prop preproc time : 0.000
% 1.83/0.69 # Success case prop encoding time : 0.000
% 1.83/0.69 # Success case prop solver time : 0.000
% 1.83/0.69 # Current number of processed clauses : 161
% 1.83/0.69 # Positive orientable unit clauses : 118
% 1.83/0.69 # Positive unorientable unit clauses: 39
% 1.83/0.69 # Negative unit clauses : 3
% 1.83/0.69 # Non-unit-clauses : 1
% 1.83/0.69 # Current number of unprocessed clauses: 11929
% 1.83/0.69 # ...number of literals in the above : 11929
% 1.83/0.69 # Current number of archived formulas : 0
% 1.83/0.69 # Current number of archived clauses : 37
% 1.83/0.69 # Clause-clause subsumption calls (NU) : 0
% 1.83/0.69 # Rec. Clause-clause subsumption calls : 0
% 1.83/0.69 # Non-unit clause-clause subsumptions : 0
% 1.83/0.69 # Unit Clause-clause subsumption calls : 1063
% 1.83/0.69 # Rewrite failures with RHS unbound : 0
% 1.83/0.69 # BW rewrite match attempts : 6033
% 1.83/0.69 # BW rewrite match successes : 162
% 1.83/0.69 # Condensation attempts : 0
% 1.83/0.69 # Condensation successes : 0
% 1.83/0.69 # Termbank termtop insertions : 405740
% 1.83/0.69 # Search garbage collected termcells : 5
% 1.83/0.69
% 1.83/0.69 # -------------------------------------------------
% 1.83/0.69 # User time : 0.194 s
% 1.83/0.69 # System time : 0.011 s
% 1.83/0.69 # Total time : 0.205 s
% 1.83/0.69 # Maximum resident set size: 1632 pages
% 1.83/0.69
% 1.83/0.69 # -------------------------------------------------
% 1.83/0.69 # User time : 0.196 s
% 1.83/0.69 # System time : 0.012 s
% 1.83/0.69 # Total time : 0.208 s
% 1.83/0.69 # Maximum resident set size: 1700 pages
% 1.83/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------