TSTP Solution File: COL061-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL061-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:49 EDT 2024
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 12 equ; 8 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_q1_combinator,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(f(X1),apply(h(X1),g(X1))),
file('/export/starexec/sandbox/tmp/tmp.30dXafNQ3E/E---3.1_18493.p',prove_q1_combinator) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.30dXafNQ3E/E---3.1_18493.p',b_definition) ).
cnf(t_definition,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.30dXafNQ3E/E---3.1_18493.p',t_definition) ).
cnf(c_0_3,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(f(X1),apply(h(X1),g(X1))),
inference(fof_simplification,[status(thm)],[prove_q1_combinator]) ).
cnf(c_0_4,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(f(X1),apply(h(X1),g(X1))),
c_0_3 ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,negated_conjecture,
apply(apply(apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),g(apply(apply(b,X1),X2))),h(apply(apply(b,X1),X2))) != apply(f(apply(apply(b,X1),X2)),apply(h(apply(apply(b,X1),X2)),g(apply(apply(b,X1),X2)))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
t_definition ).
cnf(c_0_8,negated_conjecture,
apply(apply(apply(apply(X1,f(apply(apply(b,apply(t,X2)),X1))),X2),g(apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,apply(t,X2)),X1))) != apply(f(apply(apply(b,apply(t,X2)),X1)),apply(h(apply(apply(b,apply(t,X2)),X1)),g(apply(apply(b,apply(t,X2)),X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(apply(X1,apply(X2,f(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),X3),g(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))) != apply(f(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))),apply(h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))),g(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
apply(apply(apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),apply(X2,g(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))) != apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))),apply(h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))),g(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),b))),apply(apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),b))))) != apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,X1)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),b))))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_11,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : COL061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.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 11:31:57 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.30dXafNQ3E/E---3.1_18493.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18579 completed with status 0
% 0.20/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.53 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 18584 completed with status 0
% 0.20/0.53 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 3
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 3
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 3
% 0.20/0.53 # Processed clauses : 175
% 0.20/0.53 # ...of these trivial : 0
% 0.20/0.53 # ...subsumed : 27
% 0.20/0.53 # ...remaining for further processing : 148
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 0
% 0.20/0.53 # Generated clauses : 400
% 0.20/0.53 # ...of the previous two non-redundant : 398
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 400
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 0
% 0.20/0.53 # ...of those cached : 0
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 145
% 0.20/0.53 # Positive orientable unit clauses : 2
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 143
% 0.20/0.53 # Non-unit-clauses : 0
% 0.20/0.53 # Current number of unprocessed clauses: 227
% 0.20/0.53 # ...number of literals in the above : 227
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 3
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 2502
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 0
% 0.20/0.53 # BW rewrite match successes : 0
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 40586
% 0.20/0.53 # Search garbage collected termcells : 2
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.020 s
% 0.20/0.53 # System time : 0.009 s
% 0.20/0.53 # Total time : 0.029 s
% 0.20/0.53 # Maximum resident set size: 1548 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.121 s
% 0.20/0.53 # System time : 0.027 s
% 0.20/0.53 # Total time : 0.148 s
% 0.20/0.53 # Maximum resident set size: 1688 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------