TSTP Solution File: COL077-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL077-1 : TPTP v8.1.2. Released v1.2.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:15 EDT 2024
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 14 unt; 0 nHn; 9 RR)
% Number of literals : 22 ( 21 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(extensionality2,axiom,
( X1 = X2
| apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.Lvw8QynhVY/E---3.1_24698.p',extensionality2) ).
cnf(abstraction,axiom,
apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,k(X3)),apply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.Lvw8QynhVY/E---3.1_24698.p',abstraction) ).
cnf(k_definition,axiom,
apply(k(X1),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.Lvw8QynhVY/E---3.1_24698.p',k_definition) ).
cnf(prove_TRC1a,negated_conjecture,
apply(apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),abstraction),abstraction) != identity,
file('/export/starexec/sandbox/tmp/tmp.Lvw8QynhVY/E---3.1_24698.p',prove_TRC1a) ).
cnf(identity_definition,axiom,
apply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.Lvw8QynhVY/E---3.1_24698.p',identity_definition) ).
cnf(c_0_5,plain,
( X1 = X2
| apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
inference(fof_simplification,[status(thm)],[extensionality2]) ).
cnf(c_0_6,axiom,
apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,k(X3)),apply(X2,X3)),
abstraction ).
cnf(c_0_7,axiom,
apply(k(X1),X2) = X1,
k_definition ).
cnf(c_0_8,negated_conjecture,
apply(apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),abstraction),abstraction) != identity,
inference(fof_simplification,[status(thm)],[prove_TRC1a]) ).
cnf(c_0_9,plain,
( X1 = X2
| apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
c_0_5 ).
cnf(c_0_10,axiom,
apply(identity,X1) = X1,
identity_definition ).
cnf(c_0_11,plain,
apply(apply(apply(apply(abstraction,abstraction),X1),X2),X3) = apply(X2,apply(apply(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),abstraction),abstraction) != identity,
c_0_8 ).
cnf(c_0_13,plain,
( identity = X1
| apply(X1,n(identity,X1)) != n(identity,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
apply(apply(apply(abstraction,apply(apply(abstraction,abstraction),X1)),X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_16,plain,
apply(apply(abstraction,apply(apply(abstraction,abstraction),X1)),X2) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : COL077-1 : TPTP v8.1.2. Released v1.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 12:07:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/tmp/tmp.Lvw8QynhVY/E---3.1_24698.p
% 0.17/0.49 # Version: 3.1.0
% 0.17/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24776 completed with status 0
% 0.17/0.49 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGUPM-FFSF21-MFFFFFNN
% 0.17/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.49 # Starting sh5l with 136s (1) cores
% 0.17/0.49 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 24781 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.17/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGUPM-FFSF21-MFFFFFNN
% 0.17/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.49 # Preprocessing time : 0.001 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Unsatisfiable
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 12
% 0.17/0.49 # Removed by relevancy pruning/SinE : 0
% 0.17/0.49 # Initial clauses : 12
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 12
% 0.17/0.49 # Processed clauses : 366
% 0.17/0.49 # ...of these trivial : 15
% 0.17/0.49 # ...subsumed : 108
% 0.17/0.49 # ...remaining for further processing : 243
% 0.17/0.49 # Other redundant clauses eliminated : 5
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 1
% 0.17/0.49 # Backward-rewritten : 54
% 0.17/0.49 # Generated clauses : 3479
% 0.17/0.49 # ...of the previous two non-redundant : 2653
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 0
% 0.17/0.49 # Paramodulations : 3473
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 6
% 0.17/0.49 # Disequality decompositions : 0
% 0.17/0.49 # Total rewrite steps : 2810
% 0.17/0.49 # ...of those cached : 2006
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 176
% 0.17/0.49 # Positive orientable unit clauses : 149
% 0.17/0.49 # Positive unorientable unit clauses: 3
% 0.17/0.49 # Negative unit clauses : 1
% 0.17/0.49 # Non-unit-clauses : 23
% 0.17/0.49 # Current number of unprocessed clauses: 2205
% 0.17/0.49 # ...number of literals in the above : 2634
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 67
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 204
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 204
% 0.17/0.49 # Non-unit clause-clause subsumptions : 107
% 0.17/0.49 # Unit Clause-clause subsumption calls : 40
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 717
% 0.17/0.49 # BW rewrite match successes : 58
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 54979
% 0.17/0.49 # Search garbage collected termcells : 7
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.040 s
% 0.17/0.49 # System time : 0.006 s
% 0.17/0.49 # Total time : 0.046 s
% 0.17/0.49 # Maximum resident set size: 1592 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.212 s
% 0.17/0.49 # System time : 0.013 s
% 0.17/0.49 # Total time : 0.225 s
% 0.17/0.49 # Maximum resident set size: 1696 pages
% 0.17/0.49 % E---3.1 exiting
% 0.17/0.49 % E exiting
%------------------------------------------------------------------------------