TSTP Solution File: COL011-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : COL011-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% 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 : Mon Jun 24 04:46:16 EDT 2024
% Result : Unsatisfiable 185.41s 23.89s
% Output : CNFRefutation 185.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 8 RR)
% Number of literals : 18 ( 17 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox2/tmp/tmp.8eYIg5dAPL/E---3.1_17816.p',prove_fixed_point) ).
cnf(o_definition,axiom,
apply(apply(o,X1),X2) = apply(X2,apply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.8eYIg5dAPL/E---3.1_17816.p',o_definition) ).
cnf(q1_definition,axiom,
apply(apply(apply(q1,X1),X2),X3) = apply(X1,apply(X3,X2)),
file('/export/starexec/sandbox2/tmp/tmp.8eYIg5dAPL/E---3.1_17816.p',q1_definition) ).
cnf(c_0_3,negated_conjecture,
X1 != apply(combinator,X1),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_4,axiom,
apply(apply(o,X1),X2) = apply(X2,apply(X1,X2)),
o_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(q1,X1),X2),X3) = apply(X1,apply(X3,X2)),
q1_definition ).
cnf(c_0_6,negated_conjecture,
X1 != apply(combinator,X1),
c_0_3 ).
cnf(c_0_7,plain,
apply(X1,apply(apply(X2,apply(apply(q1,X1),X3)),X3)) = apply(apply(o,X2),apply(apply(q1,X1),X3)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
apply(apply(X1,apply(apply(q1,combinator),X2)),X2) != apply(apply(o,X1),apply(apply(q1,combinator),X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
apply(X1,apply(X2,apply(X3,apply(apply(q1,X1),X3)))) = apply(apply(o,apply(q1,X2)),apply(apply(q1,X1),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
apply(X1,apply(X2,apply(apply(q1,combinator),X2))) != apply(apply(o,apply(q1,X1)),apply(apply(q1,combinator),X2)),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_11,plain,
apply(X1,apply(X2,apply(apply(o,apply(q1,X1)),X3))) = apply(apply(o,apply(q1,X2)),apply(apply(q1,X1),X3)),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_12,negated_conjecture,
apply(apply(o,apply(q1,apply(apply(q1,combinator),X1))),apply(apply(q1,combinator),X1)) != apply(apply(o,X1),apply(apply(q1,combinator),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_13,plain,
apply(apply(apply(o,X1),apply(q1,X2)),X3) = apply(X2,apply(X3,apply(X1,apply(q1,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_14,plain,
apply(X1,apply(X2,apply(apply(o,apply(q1,X1)),apply(o,apply(q1,X2))))) = apply(apply(o,apply(q1,X1)),apply(o,apply(q1,X2))),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
apply(apply(o,apply(q1,apply(apply(apply(o,X1),apply(q1,apply(q1,combinator))),X2))),apply(apply(apply(o,X1),apply(q1,apply(q1,combinator))),X2)) != apply(apply(o,apply(X2,apply(X1,apply(q1,apply(q1,combinator))))),apply(apply(apply(o,X1),apply(q1,apply(q1,combinator))),X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
apply(X1,apply(apply(apply(o,o),apply(q1,X2)),apply(o,apply(q1,X1)))) = apply(apply(o,apply(q1,X1)),apply(o,apply(q1,X2))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COL011-1 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 15:53:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.52 Running first-order model finding
% 0.20/0.52 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.8eYIg5dAPL/E---3.1_17816.p
% 185.41/23.89 # Version: 3.2.0
% 185.41/23.89 # Preprocessing class: FSSSSMSSSSSNFFN.
% 185.41/23.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 185.41/23.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 185.41/23.89 # Starting new_bool_3 with 300s (1) cores
% 185.41/23.89 # Starting new_bool_1 with 300s (1) cores
% 185.41/23.89 # Starting sh5l with 300s (1) cores
% 185.41/23.89 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17921 completed with status 0
% 185.41/23.89 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 185.41/23.89 # Preprocessing class: FSSSSMSSSSSNFFN.
% 185.41/23.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 185.41/23.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 185.41/23.89 # No SInE strategy applied
% 185.41/23.89 # Search class: FUUPS-FFSF22-MFFFFFNN
% 185.41/23.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 185.41/23.89 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 185.41/23.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 185.41/23.89 # Starting new_bool_3 with 136s (1) cores
% 185.41/23.89 # Starting new_bool_1 with 136s (1) cores
% 185.41/23.89 # Starting sh5l with 136s (1) cores
% 185.41/23.89 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 17925 completed with status 0
% 185.41/23.89 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 185.41/23.89 # Preprocessing class: FSSSSMSSSSSNFFN.
% 185.41/23.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 185.41/23.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 185.41/23.89 # No SInE strategy applied
% 185.41/23.89 # Search class: FUUPS-FFSF22-MFFFFFNN
% 185.41/23.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 185.41/23.89 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 185.41/23.89 # Preprocessing time : 0.001 s
% 185.41/23.89
% 185.41/23.89 # Proof found!
% 185.41/23.89 # SZS status Unsatisfiable
% 185.41/23.89 # SZS output start CNFRefutation
% See solution above
% 185.41/23.89 # Parsed axioms : 3
% 185.41/23.89 # Removed by relevancy pruning/SinE : 0
% 185.41/23.89 # Initial clauses : 3
% 185.41/23.89 # Removed in clause preprocessing : 0
% 185.41/23.89 # Initial clauses in saturation : 3
% 185.41/23.89 # Processed clauses : 5540
% 185.41/23.89 # ...of these trivial : 177
% 185.41/23.89 # ...subsumed : 4031
% 185.41/23.89 # ...remaining for further processing : 1332
% 185.41/23.89 # Other redundant clauses eliminated : 0
% 185.41/23.89 # Clauses deleted for lack of memory : 0
% 185.41/23.89 # Backward-subsumed : 86
% 185.41/23.89 # Backward-rewritten : 97
% 185.41/23.89 # Generated clauses : 520296
% 185.41/23.89 # ...of the previous two non-redundant : 511618
% 185.41/23.89 # ...aggressively subsumed : 0
% 185.41/23.89 # Contextual simplify-reflections : 0
% 185.41/23.89 # Paramodulations : 520296
% 185.41/23.89 # Factorizations : 0
% 185.41/23.89 # NegExts : 0
% 185.41/23.89 # Equation resolutions : 0
% 185.41/23.89 # Disequality decompositions : 0
% 185.41/23.89 # Total rewrite steps : 407144
% 185.41/23.89 # ...of those cached : 355435
% 185.41/23.89 # Propositional unsat checks : 0
% 185.41/23.89 # Propositional check models : 0
% 185.41/23.89 # Propositional check unsatisfiable : 0
% 185.41/23.89 # Propositional clauses : 0
% 185.41/23.89 # Propositional clauses after purity: 0
% 185.41/23.89 # Propositional unsat core size : 0
% 185.41/23.89 # Propositional preprocessing time : 0.000
% 185.41/23.89 # Propositional encoding time : 0.000
% 185.41/23.89 # Propositional solver time : 0.000
% 185.41/23.89 # Success case prop preproc time : 0.000
% 185.41/23.89 # Success case prop encoding time : 0.000
% 185.41/23.89 # Success case prop solver time : 0.000
% 185.41/23.89 # Current number of processed clauses : 1149
% 185.41/23.89 # Positive orientable unit clauses : 208
% 185.41/23.89 # Positive unorientable unit clauses: 83
% 185.41/23.89 # Negative unit clauses : 858
% 185.41/23.89 # Non-unit-clauses : 0
% 185.41/23.89 # Current number of unprocessed clauses: 505369
% 185.41/23.89 # ...number of literals in the above : 505369
% 185.41/23.89 # Current number of archived formulas : 0
% 185.41/23.89 # Current number of archived clauses : 183
% 185.41/23.89 # Clause-clause subsumption calls (NU) : 0
% 185.41/23.89 # Rec. Clause-clause subsumption calls : 0
% 185.41/23.89 # Non-unit clause-clause subsumptions : 0
% 185.41/23.89 # Unit Clause-clause subsumption calls : 150332
% 185.41/23.89 # Rewrite failures with RHS unbound : 0
% 185.41/23.89 # BW rewrite match attempts : 131258
% 185.41/23.89 # BW rewrite match successes : 403
% 185.41/23.89 # Condensation attempts : 0
% 185.41/23.89 # Condensation successes : 0
% 185.41/23.89 # Termbank termtop insertions : 34113209
% 185.41/23.89 # Search garbage collected termcells : 2
% 185.41/23.89
% 185.41/23.89 # -------------------------------------------------
% 185.41/23.89 # User time : 22.550 s
% 185.41/23.89 # System time : 0.614 s
% 185.41/23.89 # Total time : 23.164 s
% 185.41/23.89 # Maximum resident set size: 1540 pages
% 185.41/23.89
% 185.41/23.89 # -------------------------------------------------
% 185.41/23.89 # User time : 114.274 s
% 185.41/23.89 # System time : 1.278 s
% 185.41/23.89 # Total time : 115.552 s
% 185.41/23.89 # Maximum resident set size: 1684 pages
% 185.41/23.89 % E---3.1 exiting
% 185.41/23.89 % E exiting
%------------------------------------------------------------------------------