TSTP Solution File: COL080-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL080-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:29:00 EDT 2024
% Result : Unsatisfiable 0.18s 0.60s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 12 unt; 0 nHn; 9 RR)
% Number of literals : 22 ( 21 equ; 8 neg)
% Maximal clause size : 2 ( 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; 2 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(abstraction,axiom,
apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,k(X3)),apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.no8EetMN9C/E---3.1_10955.p',abstraction) ).
cnf(k_definition,axiom,
apply(k(X1),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.no8EetMN9C/E---3.1_10955.p',k_definition) ).
cnf(extensionality2,axiom,
( X1 = X2
| apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.no8EetMN9C/E---3.1_10955.p',extensionality2) ).
cnf(prove_TRC2b,negated_conjecture,
k(b) != apply(abstraction,apply(abstraction,k(b))),
file('/export/starexec/sandbox2/tmp/tmp.no8EetMN9C/E---3.1_10955.p',prove_TRC2b) ).
cnf(c_0_4,axiom,
apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,k(X3)),apply(X2,X3)),
abstraction ).
cnf(c_0_5,axiom,
apply(k(X1),X2) = X1,
k_definition ).
cnf(c_0_6,plain,
( X1 = X2
| apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
inference(fof_simplification,[status(thm)],[extensionality2]) ).
cnf(c_0_7,plain,
apply(apply(apply(abstraction,k(X1)),X2),X3) = apply(X1,apply(X2,X3)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( X1 = X2
| apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
c_0_6 ).
cnf(c_0_9,plain,
apply(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3) = apply(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_5]) ).
cnf(c_0_10,plain,
( apply(apply(abstraction,apply(abstraction,k(X1))),X2) = X3
| apply(X1,n(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3)) != apply(X3,n(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
k(b) != apply(abstraction,apply(abstraction,k(b))),
inference(fof_simplification,[status(thm)],[prove_TRC2b]) ).
cnf(c_0_12,plain,
( k(X1) = X2
| apply(X2,n(k(X1),X2)) != X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_13,plain,
apply(apply(abstraction,apply(abstraction,k(X1))),X2) = X1,
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
k(b) != apply(abstraction,apply(abstraction,k(b))),
c_0_11 ).
cnf(c_0_15,plain,
apply(abstraction,apply(abstraction,k(X1))) = k(X1),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : COL080-1 : TPTP v8.1.2. Released v1.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n015.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 : Fri May 3 11:57:36 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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.no8EetMN9C/E---3.1_10955.p
% 0.18/0.60 # Version: 3.1.0
% 0.18/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.60 # Starting sh5l with 300s (1) cores
% 0.18/0.60 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11060 completed with status 0
% 0.18/0.60 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.18/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.60 # No SInE strategy applied
% 0.18/0.60 # Search class: FGUPM-FFSF21-MFFFFFNN
% 0.18/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.60 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.18/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.18/0.60 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.60 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.60 # Starting sh5l with 136s (1) cores
% 0.18/0.60 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 11065 completed with status 0
% 0.18/0.60 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.18/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.60 # No SInE strategy applied
% 0.18/0.60 # Search class: FGUPM-FFSF21-MFFFFFNN
% 0.18/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.60 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.18/0.60 # Preprocessing time : 0.001 s
% 0.18/0.60 # Presaturation interreduction done
% 0.18/0.60
% 0.18/0.60 # Proof found!
% 0.18/0.60 # SZS status Unsatisfiable
% 0.18/0.60 # SZS output start CNFRefutation
% See solution above
% 0.18/0.60 # Parsed axioms : 12
% 0.18/0.60 # Removed by relevancy pruning/SinE : 0
% 0.18/0.60 # Initial clauses : 12
% 0.18/0.60 # Removed in clause preprocessing : 0
% 0.18/0.60 # Initial clauses in saturation : 12
% 0.18/0.60 # Processed clauses : 574
% 0.18/0.60 # ...of these trivial : 53
% 0.18/0.60 # ...subsumed : 178
% 0.18/0.60 # ...remaining for further processing : 343
% 0.18/0.60 # Other redundant clauses eliminated : 77
% 0.18/0.60 # Clauses deleted for lack of memory : 0
% 0.18/0.60 # Backward-subsumed : 0
% 0.18/0.60 # Backward-rewritten : 81
% 0.18/0.60 # Generated clauses : 7922
% 0.18/0.60 # ...of the previous two non-redundant : 6458
% 0.18/0.60 # ...aggressively subsumed : 0
% 0.18/0.60 # Contextual simplify-reflections : 0
% 0.18/0.60 # Paramodulations : 7843
% 0.18/0.60 # Factorizations : 0
% 0.18/0.60 # NegExts : 0
% 0.18/0.60 # Equation resolutions : 79
% 0.18/0.60 # Disequality decompositions : 0
% 0.18/0.60 # Total rewrite steps : 7576
% 0.18/0.60 # ...of those cached : 5221
% 0.18/0.60 # Propositional unsat checks : 0
% 0.18/0.60 # Propositional check models : 0
% 0.18/0.60 # Propositional check unsatisfiable : 0
% 0.18/0.60 # Propositional clauses : 0
% 0.18/0.60 # Propositional clauses after purity: 0
% 0.18/0.60 # Propositional unsat core size : 0
% 0.18/0.60 # Propositional preprocessing time : 0.000
% 0.18/0.60 # Propositional encoding time : 0.000
% 0.18/0.60 # Propositional solver time : 0.000
% 0.18/0.60 # Success case prop preproc time : 0.000
% 0.18/0.60 # Success case prop encoding time : 0.000
% 0.18/0.60 # Success case prop solver time : 0.000
% 0.18/0.60 # Current number of processed clauses : 250
% 0.18/0.60 # Positive orientable unit clauses : 207
% 0.18/0.60 # Positive unorientable unit clauses: 10
% 0.18/0.60 # Negative unit clauses : 1
% 0.18/0.60 # Non-unit-clauses : 32
% 0.18/0.60 # Current number of unprocessed clauses: 5639
% 0.18/0.60 # ...number of literals in the above : 6866
% 0.18/0.60 # Current number of archived formulas : 0
% 0.18/0.60 # Current number of archived clauses : 93
% 0.18/0.60 # Clause-clause subsumption calls (NU) : 359
% 0.18/0.60 # Rec. Clause-clause subsumption calls : 359
% 0.18/0.60 # Non-unit clause-clause subsumptions : 176
% 0.18/0.60 # Unit Clause-clause subsumption calls : 72
% 0.18/0.60 # Rewrite failures with RHS unbound : 0
% 0.18/0.60 # BW rewrite match attempts : 966
% 0.18/0.60 # BW rewrite match successes : 91
% 0.18/0.60 # Condensation attempts : 0
% 0.18/0.60 # Condensation successes : 0
% 0.18/0.60 # Termbank termtop insertions : 155139
% 0.18/0.60 # Search garbage collected termcells : 7
% 0.18/0.60
% 0.18/0.60 # -------------------------------------------------
% 0.18/0.60 # User time : 0.124 s
% 0.18/0.60 # System time : 0.005 s
% 0.18/0.60 # Total time : 0.129 s
% 0.18/0.60 # Maximum resident set size: 1592 pages
% 0.18/0.60
% 0.18/0.60 # -------------------------------------------------
% 0.18/0.60 # User time : 0.623 s
% 0.18/0.60 # System time : 0.017 s
% 0.18/0.60 # Total time : 0.640 s
% 0.18/0.60 # Maximum resident set size: 1696 pages
% 0.18/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------