TSTP Solution File: COL044-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL044-2 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 May 20 19:02:14 EDT 2024
% Result : Unsatisfiable 1.78s 0.70s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 10 RR)
% Number of literals : 23 ( 16 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 12 ( 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',strong_fixed_point) ).
cnf(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(c_0_4,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),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,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_7,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_8,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)),
c_0_4 ).
cnf(c_0_9,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
c_0_5 ).
cnf(c_0_10,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_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
apply(fixed_pt,apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n),apply(b,apply(b,fixed_pt)))) != apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n),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_8,c_0_9]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).
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_7,c_0_10]) ).
cnf(c_0_13,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_6,c_0_6]),c_0_6]) ).
cnf(c_0_14,negated_conjecture,
apply(fixed_pt,apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
apply(apply(X1,X2),apply(X1,X2)) = apply(apply(apply(n,apply(n,apply(b,b))),X1),X2),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,plain,
apply(apply(apply(n,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X3,X2)),X3),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_17,negated_conjecture,
apply(fixed_pt,apply(apply(apply(n,apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(n,apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),apply(n,apply(b,apply(b,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_18,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_7,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL044-2 : TPTP v8.2.0. Released v1.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.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 : Sat May 18 13:20:22 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/benchmark/theBenchmark.p
% 1.78/0.70 # Version: 3.1.0
% 1.78/0.70 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.70 # Starting new_bool_3 with 300s (1) cores
% 1.78/0.70 # Starting new_bool_1 with 300s (1) cores
% 1.78/0.70 # Starting sh5l with 300s (1) cores
% 1.78/0.70 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11310 completed with status 0
% 1.78/0.70 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.78/0.70 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.70 # No SInE strategy applied
% 1.78/0.70 # Search class: FHUSS-FFSF22-DFFFFFNN
% 1.78/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.78/0.70 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.78/0.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.78/0.70 # Starting new_bool_3 with 136s (1) cores
% 1.78/0.70 # Starting new_bool_1 with 136s (1) cores
% 1.78/0.70 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11315 completed with status 0
% 1.78/0.70 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.78/0.70 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.70 # No SInE strategy applied
% 1.78/0.70 # Search class: FHUSS-FFSF22-DFFFFFNN
% 1.78/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.78/0.70 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.78/0.70 # Preprocessing time : 0.055 s
% 1.78/0.70
% 1.78/0.70 # Proof found!
% 1.78/0.70 # SZS status Unsatisfiable
% 1.78/0.70 # SZS output start CNFRefutation
% See solution above
% 1.78/0.70 # Parsed axioms : 4
% 1.78/0.70 # Removed by relevancy pruning/SinE : 0
% 1.78/0.70 # Initial clauses : 4
% 1.78/0.70 # Removed in clause preprocessing : 0
% 1.78/0.70 # Initial clauses in saturation : 4
% 1.78/0.70 # Processed clauses : 182
% 1.78/0.70 # ...of these trivial : 48
% 1.78/0.70 # ...subsumed : 37
% 1.78/0.70 # ...remaining for further processing : 97
% 1.78/0.70 # Other redundant clauses eliminated : 0
% 1.78/0.70 # Clauses deleted for lack of memory : 0
% 1.78/0.70 # Backward-subsumed : 0
% 1.78/0.70 # Backward-rewritten : 5
% 1.78/0.70 # Generated clauses : 9914
% 1.78/0.70 # ...of the previous two non-redundant : 9330
% 1.78/0.70 # ...aggressively subsumed : 0
% 1.78/0.70 # Contextual simplify-reflections : 0
% 1.78/0.70 # Paramodulations : 9914
% 1.78/0.70 # Factorizations : 0
% 1.78/0.70 # NegExts : 0
% 1.78/0.70 # Equation resolutions : 0
% 1.78/0.70 # Disequality decompositions : 0
% 1.78/0.70 # Total rewrite steps : 1170
% 1.78/0.70 # ...of those cached : 400
% 1.78/0.70 # Propositional unsat checks : 0
% 1.78/0.70 # Propositional check models : 0
% 1.78/0.70 # Propositional check unsatisfiable : 0
% 1.78/0.70 # Propositional clauses : 0
% 1.78/0.70 # Propositional clauses after purity: 0
% 1.78/0.70 # Propositional unsat core size : 0
% 1.78/0.70 # Propositional preprocessing time : 0.000
% 1.78/0.70 # Propositional encoding time : 0.000
% 1.78/0.70 # Propositional solver time : 0.000
% 1.78/0.70 # Success case prop preproc time : 0.000
% 1.78/0.70 # Success case prop encoding time : 0.000
% 1.78/0.70 # Success case prop solver time : 0.000
% 1.78/0.70 # Current number of processed clauses : 92
% 1.78/0.70 # Positive orientable unit clauses : 54
% 1.78/0.70 # Positive unorientable unit clauses: 36
% 1.78/0.70 # Negative unit clauses : 1
% 1.78/0.70 # Non-unit-clauses : 1
% 1.78/0.70 # Current number of unprocessed clauses: 9152
% 1.78/0.70 # ...number of literals in the above : 9152
% 1.78/0.70 # Current number of archived formulas : 0
% 1.78/0.70 # Current number of archived clauses : 5
% 1.78/0.70 # Clause-clause subsumption calls (NU) : 0
% 1.78/0.70 # Rec. Clause-clause subsumption calls : 0
% 1.78/0.70 # Non-unit clause-clause subsumptions : 0
% 1.78/0.70 # Unit Clause-clause subsumption calls : 675
% 1.78/0.70 # Rewrite failures with RHS unbound : 0
% 1.78/0.70 # BW rewrite match attempts : 4747
% 1.78/0.70 # BW rewrite match successes : 59
% 1.78/0.70 # Condensation attempts : 0
% 1.78/0.70 # Condensation successes : 0
% 1.78/0.70 # Termbank termtop insertions : 318393
% 1.78/0.70 # Search garbage collected termcells : 5
% 1.78/0.70
% 1.78/0.70 # -------------------------------------------------
% 1.78/0.70 # User time : 0.198 s
% 1.78/0.70 # System time : 0.016 s
% 1.78/0.70 # Total time : 0.214 s
% 1.78/0.70 # Maximum resident set size: 1596 pages
% 1.78/0.70
% 1.78/0.70 # -------------------------------------------------
% 1.78/0.70 # User time : 1.031 s
% 1.78/0.70 # System time : 0.043 s
% 1.78/0.70 # Total time : 1.074 s
% 1.78/0.70 # Maximum resident set size: 1704 pages
% 1.78/0.70 % E---3.1 exiting
% 1.78/0.70 % E exiting
%------------------------------------------------------------------------------