TSTP Solution File: COL057-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL057-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:48 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 7 RR)
% Number of literals : 15 ( 14 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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_strong_fixed_point,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
file('/export/starexec/sandbox2/tmp/tmp.uctpQ72u15/E---3.1_21351.p',prove_strong_fixed_point) ).
cnf(s_definition,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.uctpQ72u15/E---3.1_21351.p',s_definition) ).
cnf(i_definition,axiom,
apply(i,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.uctpQ72u15/E---3.1_21351.p',i_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.uctpQ72u15/E---3.1_21351.p',b_definition) ).
cnf(c_0_4,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
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,axiom,
apply(i,X1) = X1,
i_definition ).
cnf(c_0_7,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
c_0_4 ).
cnf(c_0_8,plain,
apply(apply(apply(s,i),X1),X2) = apply(X2,apply(X1,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_10,negated_conjecture,
apply(apply(apply(s,i),X1),f(X1)) != apply(X1,f(X1)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
apply(apply(apply(s,apply(b,X1)),X2),X3) = apply(X1,apply(X3,apply(X2,X3))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_12,negated_conjecture,
apply(apply(apply(apply(s,apply(b,apply(s,i))),X1),X2),f(apply(X2,apply(X1,X2)))) != apply(apply(X2,apply(X1,X2)),f(apply(X2,apply(X1,X2)))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
apply(apply(apply(apply(s,apply(b,apply(s,i))),i),X1),f(apply(X1,X1))) != apply(apply(X1,X1),f(apply(X1,X1))),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL057-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:10:06 EDT 2024
% 0.14/0.35 % 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.uctpQ72u15/E---3.1_21351.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21483 completed with status 0
% 0.20/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.51 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.51 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21488 completed with status 0
% 0.20/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 5
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 5
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 5
% 0.20/0.51 # Processed clauses : 41
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 8
% 0.20/0.51 # ...remaining for further processing : 33
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 6
% 0.20/0.51 # Generated clauses : 829
% 0.20/0.51 # ...of the previous two non-redundant : 775
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 828
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 1
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 127
% 0.20/0.51 # ...of those cached : 72
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 27
% 0.20/0.51 # Positive orientable unit clauses : 5
% 0.20/0.51 # Positive unorientable unit clauses: 9
% 0.20/0.51 # Negative unit clauses : 13
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 736
% 0.20/0.51 # ...number of literals in the above : 736
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 6
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 39
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 258
% 0.20/0.51 # BW rewrite match successes : 12
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 16332
% 0.20/0.51 # Search garbage collected termcells : 2
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.021 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.023 s
% 0.20/0.51 # Maximum resident set size: 1544 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.094 s
% 0.20/0.51 # System time : 0.013 s
% 0.20/0.51 # Total time : 0.106 s
% 0.20/0.51 # Maximum resident set size: 1688 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------