TSTP Solution File: COL006-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL006-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:36 EDT 2024
% Result : Unsatisfiable 110.18s 14.39s
% Output : CNFRefutation 110.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 27 ( 24 unt; 0 nHn; 12 RR)
% Number of literals : 30 ( 23 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 8 ( 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 : 44 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_definition,axiom,
apply(apply(k,X1),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ZHsSuRTT8P/E---3.1_14715.p',k_definition) ).
cnf(s_definition,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ZHsSuRTT8P/E---3.1_14715.p',s_definition) ).
cnf(prove_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(k,apply(apply(s,s),apply(s,k)))),apply(apply(s,apply(k,s)),k)))),
file('/export/starexec/sandbox2/tmp/tmp.ZHsSuRTT8P/E---3.1_14715.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/sandbox2/tmp/tmp.ZHsSuRTT8P/E---3.1_14715.p',strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(k,X1),X2) = X1,
k_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
s_definition ).
cnf(c_0_6,plain,
apply(apply(apply(s,k),X1),X2) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
~ fixed_point(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(k,apply(apply(s,s),apply(s,k)))),apply(apply(s,apply(k,s)),k)))),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_8,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_9,plain,
apply(apply(apply(s,apply(s,k)),X1),X2) = apply(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ fixed_point(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(k,apply(apply(s,s),apply(s,k)))),apply(apply(s,apply(k,s)),k)))),
c_0_7 ).
cnf(c_0_11,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
c_0_8 ).
cnf(c_0_12,plain,
apply(apply(apply(s,apply(apply(s,k),X1)),X2),X3) = apply(X3,apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,plain,
apply(apply(apply(s,apply(s,apply(s,k))),X1),X2) = apply(X2,apply(X1,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_14,plain,
apply(apply(apply(s,apply(k,X1)),X2),X3) = apply(X1,apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_15,negated_conjecture,
apply(fixed_pt,apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt))))) != apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_5]),c_0_4]),c_0_5]),c_0_4]),c_0_5]),c_0_4]),c_0_5]),c_0_4]),c_0_5]),c_0_4]),c_0_5]),c_0_4]) ).
cnf(c_0_16,plain,
apply(apply(apply(s,apply(apply(s,k),X1)),X2),X3) = apply(apply(apply(s,apply(s,apply(s,k))),X2),X3),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
apply(apply(apply(s,apply(s,apply(k,X1))),X2),X3) = apply(X1,apply(X3,apply(X2,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
apply(fixed_pt,apply(apply(apply(s,apply(s,apply(s,k))),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt))))) != apply(apply(apply(s,apply(s,apply(s,k))),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
apply(X1,apply(apply(apply(s,apply(s,apply(s,k))),X2),X3)) = apply(apply(apply(s,apply(s,apply(k,X1))),X2),X3),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
apply(apply(apply(s,X1),apply(apply(s,k),X2)),X3) = apply(apply(X1,X3),X3),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_21,negated_conjecture,
apply(apply(apply(s,apply(s,apply(k,fixed_pt))),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))) != apply(apply(apply(s,apply(s,apply(s,k))),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
apply(apply(apply(s,X1),apply(apply(s,k),X2)),X3) = apply(apply(apply(s,X1),apply(apply(s,k),X4)),X3),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
apply(apply(apply(s,apply(s,apply(k,fixed_pt))),apply(apply(s,k),s)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))) != apply(apply(apply(s,apply(s,apply(s,k))),apply(apply(s,k),s)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
apply(apply(apply(s,apply(s,apply(k,fixed_pt))),apply(apply(s,k),X1)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))) != apply(apply(apply(s,apply(s,apply(s,k))),apply(apply(s,k),s)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,fixed_pt)))),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_25,plain,
apply(apply(apply(s,apply(s,apply(s,k))),apply(apply(s,k),X1)),X2) = apply(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_6]),c_0_16]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_5]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL006-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.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:39:29 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ZHsSuRTT8P/E---3.1_14715.p
% 110.18/14.39 # Version: 3.1.0
% 110.18/14.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 110.18/14.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.18/14.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 110.18/14.39 # Starting new_bool_3 with 300s (1) cores
% 110.18/14.39 # Starting new_bool_1 with 300s (1) cores
% 110.18/14.39 # Starting sh5l with 300s (1) cores
% 110.18/14.39 # sh5l with pid 14819 completed with status 0
% 110.18/14.39 # Result found by sh5l
% 110.18/14.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 110.18/14.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.18/14.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 110.18/14.39 # Starting new_bool_3 with 300s (1) cores
% 110.18/14.39 # Starting new_bool_1 with 300s (1) cores
% 110.18/14.39 # Starting sh5l with 300s (1) cores
% 110.18/14.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 110.18/14.39 # Search class: FHUSS-FFSF22-DFFFFFNN
% 110.18/14.39 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 110.18/14.39 # Starting SAT001_MinMin_p005000_rr_RG with 163s (1) cores
% 110.18/14.39 # SAT001_MinMin_p005000_rr_RG with pid 14827 completed with status 0
% 110.18/14.39 # Result found by SAT001_MinMin_p005000_rr_RG
% 110.18/14.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 110.18/14.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.18/14.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 110.18/14.39 # Starting new_bool_3 with 300s (1) cores
% 110.18/14.39 # Starting new_bool_1 with 300s (1) cores
% 110.18/14.39 # Starting sh5l with 300s (1) cores
% 110.18/14.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 110.18/14.39 # Search class: FHUSS-FFSF22-DFFFFFNN
% 110.18/14.39 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 110.18/14.39 # Starting SAT001_MinMin_p005000_rr_RG with 163s (1) cores
% 110.18/14.39 # Preprocessing time : 0.001 s
% 110.18/14.39 # Presaturation interreduction done
% 110.18/14.39
% 110.18/14.39 # Proof found!
% 110.18/14.39 # SZS status Unsatisfiable
% 110.18/14.39 # SZS output start CNFRefutation
% See solution above
% 110.18/14.39 # Parsed axioms : 4
% 110.18/14.39 # Removed by relevancy pruning/SinE : 0
% 110.18/14.39 # Initial clauses : 4
% 110.18/14.39 # Removed in clause preprocessing : 0
% 110.18/14.39 # Initial clauses in saturation : 4
% 110.18/14.39 # Processed clauses : 3551
% 110.18/14.39 # ...of these trivial : 1337
% 110.18/14.39 # ...subsumed : 1155
% 110.18/14.39 # ...remaining for further processing : 1059
% 110.18/14.39 # Other redundant clauses eliminated : 0
% 110.18/14.39 # Clauses deleted for lack of memory : 0
% 110.18/14.39 # Backward-subsumed : 3
% 110.18/14.39 # Backward-rewritten : 101
% 110.18/14.39 # Generated clauses : 500736
% 110.18/14.39 # ...of the previous two non-redundant : 474372
% 110.18/14.39 # ...aggressively subsumed : 0
% 110.18/14.39 # Contextual simplify-reflections : 0
% 110.18/14.39 # Paramodulations : 500736
% 110.18/14.39 # Factorizations : 0
% 110.18/14.39 # NegExts : 0
% 110.18/14.39 # Equation resolutions : 0
% 110.18/14.39 # Disequality decompositions : 0
% 110.18/14.39 # Total rewrite steps : 365138
% 110.18/14.39 # ...of those cached : 269733
% 110.18/14.39 # Propositional unsat checks : 0
% 110.18/14.39 # Propositional check models : 0
% 110.18/14.39 # Propositional check unsatisfiable : 0
% 110.18/14.39 # Propositional clauses : 0
% 110.18/14.39 # Propositional clauses after purity: 0
% 110.18/14.39 # Propositional unsat core size : 0
% 110.18/14.39 # Propositional preprocessing time : 0.000
% 110.18/14.39 # Propositional encoding time : 0.000
% 110.18/14.39 # Propositional solver time : 0.000
% 110.18/14.39 # Success case prop preproc time : 0.000
% 110.18/14.39 # Success case prop encoding time : 0.000
% 110.18/14.39 # Success case prop solver time : 0.000
% 110.18/14.39 # Current number of processed clauses : 951
% 110.18/14.39 # Positive orientable unit clauses : 819
% 110.18/14.39 # Positive unorientable unit clauses: 129
% 110.18/14.39 # Negative unit clauses : 2
% 110.18/14.39 # Non-unit-clauses : 1
% 110.18/14.39 # Current number of unprocessed clauses: 470404
% 110.18/14.39 # ...number of literals in the above : 470404
% 110.18/14.39 # Current number of archived formulas : 0
% 110.18/14.39 # Current number of archived clauses : 108
% 110.18/14.39 # Clause-clause subsumption calls (NU) : 0
% 110.18/14.39 # Rec. Clause-clause subsumption calls : 0
% 110.18/14.39 # Non-unit clause-clause subsumptions : 0
% 110.18/14.39 # Unit Clause-clause subsumption calls : 29658
% 110.18/14.39 # Rewrite failures with RHS unbound : 0
% 110.18/14.39 # BW rewrite match attempts : 201553
% 110.18/14.39 # BW rewrite match successes : 1272
% 110.18/14.39 # Condensation attempts : 0
% 110.18/14.39 # Condensation successes : 0
% 110.18/14.39 # Termbank termtop insertions : 25565873
% 110.18/14.39 # Search garbage collected termcells : 5
% 110.18/14.39
% 110.18/14.39 # -------------------------------------------------
% 110.18/14.39 # User time : 13.403 s
% 110.18/14.39 # System time : 0.418 s
% 110.18/14.39 # Total time : 13.821 s
% 110.18/14.39 # Maximum resident set size: 1632 pages
% 110.18/14.39
% 110.18/14.39 # -------------------------------------------------
% 110.18/14.39 # User time : 13.405 s
% 110.18/14.39 # System time : 0.419 s
% 110.18/14.39 # Total time : 13.824 s
% 110.18/14.39 # Maximum resident set size: 1692 pages
% 110.18/14.39 % E---3.1 exiting
%------------------------------------------------------------------------------