TSTP Solution File: COL034-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL034-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:40 EDT 2024
% Result : Unsatisfiable 5.28s 1.18s
% Output : CNFRefutation 5.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 14 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_fixed_point,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
file('/export/starexec/sandbox2/tmp/tmp.qPkALOyOOj/E---3.1_13128.p',prove_fixed_point) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.qPkALOyOOj/E---3.1_13128.p',b_definition) ).
cnf(t_definition,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.qPkALOyOOj/E---3.1_13128.p',t_definition) ).
cnf(m_definition,axiom,
apply(m,X1) = apply(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.qPkALOyOOj/E---3.1_13128.p',m_definition) ).
cnf(c_0_4,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_5,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
c_0_4 ).
cnf(c_0_6,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_7,negated_conjecture,
apply(f(apply(apply(b,X1),X2)),apply(X1,apply(X2,f(apply(apply(b,X1),X2))))) != apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
apply(f(apply(apply(b,X1),apply(apply(b,X2),X3))),apply(X1,apply(X2,apply(X3,f(apply(apply(b,X1),apply(apply(b,X2),X3))))))) != apply(X1,apply(X2,apply(X3,f(apply(apply(b,X1),apply(apply(b,X2),X3)))))),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
t_definition ).
cnf(c_0_10,axiom,
apply(m,X1) = apply(X1,X1),
m_definition ).
cnf(c_0_11,negated_conjecture,
apply(f(apply(apply(b,X1),apply(apply(b,apply(t,X2)),X3))),apply(X1,apply(apply(X3,f(apply(apply(b,X1),apply(apply(b,apply(t,X2)),X3)))),X2))) != apply(X1,apply(apply(X3,f(apply(apply(b,X1),apply(apply(b,apply(t,X2)),X3)))),X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_13,negated_conjecture,
apply(m,apply(apply(b,f(apply(apply(b,X1),apply(apply(b,apply(t,X1)),b)))),X1)) != apply(X1,apply(apply(b,f(apply(apply(b,X1),apply(apply(b,apply(t,X1)),b)))),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL034-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:04:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.qPkALOyOOj/E---3.1_13128.p
% 5.28/1.18 # Version: 3.1.0
% 5.28/1.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.28/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.28/1.18 # Starting new_bool_3 with 300s (1) cores
% 5.28/1.18 # Starting new_bool_1 with 300s (1) cores
% 5.28/1.18 # Starting sh5l with 300s (1) cores
% 5.28/1.18 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 13206 completed with status 0
% 5.28/1.18 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.28/1.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.28/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.28/1.18 # No SInE strategy applied
% 5.28/1.18 # Search class: FUUPS-FFSF21-MFFFFFNN
% 5.28/1.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.28/1.18 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 5.28/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.28/1.18 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.28/1.18 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.28/1.18 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.28/1.18 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 13214 completed with status 0
% 5.28/1.18 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 5.28/1.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.28/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.28/1.18 # No SInE strategy applied
% 5.28/1.18 # Search class: FUUPS-FFSF21-MFFFFFNN
% 5.28/1.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.28/1.18 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 5.28/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.28/1.18 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.28/1.18 # Preprocessing time : 0.001 s
% 5.28/1.18 # Presaturation interreduction done
% 5.28/1.18
% 5.28/1.18 # Proof found!
% 5.28/1.18 # SZS status Unsatisfiable
% 5.28/1.18 # SZS output start CNFRefutation
% See solution above
% 5.28/1.18 # Parsed axioms : 4
% 5.28/1.18 # Removed by relevancy pruning/SinE : 0
% 5.28/1.18 # Initial clauses : 4
% 5.28/1.18 # Removed in clause preprocessing : 0
% 5.28/1.18 # Initial clauses in saturation : 4
% 5.28/1.18 # Processed clauses : 1948
% 5.28/1.18 # ...of these trivial : 7
% 5.28/1.18 # ...subsumed : 1308
% 5.28/1.18 # ...remaining for further processing : 633
% 5.28/1.18 # Other redundant clauses eliminated : 0
% 5.28/1.18 # Clauses deleted for lack of memory : 0
% 5.28/1.18 # Backward-subsumed : 5
% 5.28/1.18 # Backward-rewritten : 28
% 5.28/1.18 # Generated clauses : 24023
% 5.28/1.18 # ...of the previous two non-redundant : 23937
% 5.28/1.18 # ...aggressively subsumed : 0
% 5.28/1.18 # Contextual simplify-reflections : 0
% 5.28/1.18 # Paramodulations : 24022
% 5.28/1.18 # Factorizations : 0
% 5.28/1.18 # NegExts : 0
% 5.28/1.18 # Equation resolutions : 1
% 5.28/1.18 # Disequality decompositions : 0
% 5.28/1.18 # Total rewrite steps : 63841
% 5.28/1.18 # ...of those cached : 58538
% 5.28/1.18 # Propositional unsat checks : 0
% 5.28/1.18 # Propositional check models : 0
% 5.28/1.18 # Propositional check unsatisfiable : 0
% 5.28/1.18 # Propositional clauses : 0
% 5.28/1.18 # Propositional clauses after purity: 0
% 5.28/1.18 # Propositional unsat core size : 0
% 5.28/1.18 # Propositional preprocessing time : 0.000
% 5.28/1.18 # Propositional encoding time : 0.000
% 5.28/1.18 # Propositional solver time : 0.000
% 5.28/1.18 # Success case prop preproc time : 0.000
% 5.28/1.18 # Success case prop encoding time : 0.000
% 5.28/1.18 # Success case prop solver time : 0.000
% 5.28/1.18 # Current number of processed clauses : 596
% 5.28/1.18 # Positive orientable unit clauses : 32
% 5.28/1.18 # Positive unorientable unit clauses: 9
% 5.28/1.18 # Negative unit clauses : 555
% 5.28/1.18 # Non-unit-clauses : 0
% 5.28/1.18 # Current number of unprocessed clauses: 21890
% 5.28/1.18 # ...number of literals in the above : 21890
% 5.28/1.18 # Current number of archived formulas : 0
% 5.28/1.18 # Current number of archived clauses : 37
% 5.28/1.18 # Clause-clause subsumption calls (NU) : 0
% 5.28/1.18 # Rec. Clause-clause subsumption calls : 0
% 5.28/1.18 # Non-unit clause-clause subsumptions : 0
% 5.28/1.18 # Unit Clause-clause subsumption calls : 61033
% 5.28/1.18 # Rewrite failures with RHS unbound : 0
% 5.28/1.18 # BW rewrite match attempts : 2880
% 5.28/1.18 # BW rewrite match successes : 53
% 5.28/1.18 # Condensation attempts : 0
% 5.28/1.18 # Condensation successes : 0
% 5.28/1.18 # Termbank termtop insertions : 1491056
% 5.28/1.18 # Search garbage collected termcells : 2
% 5.28/1.18
% 5.28/1.18 # -------------------------------------------------
% 5.28/1.18 # User time : 0.621 s
% 5.28/1.18 # System time : 0.030 s
% 5.28/1.18 # Total time : 0.651 s
% 5.28/1.18 # Maximum resident set size: 1548 pages
% 5.28/1.18
% 5.28/1.18 # -------------------------------------------------
% 5.28/1.18 # User time : 3.166 s
% 5.28/1.18 # System time : 0.134 s
% 5.28/1.18 # Total time : 3.300 s
% 5.28/1.18 # Maximum resident set size: 1688 pages
% 5.28/1.18 % E---3.1 exiting
%------------------------------------------------------------------------------