TSTP Solution File: COL044-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL044-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:43 EDT 2024
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 6 RR)
% Number of literals : 13 ( 12 equ; 5 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.UOcSOPzisd/E---3.1_21127.p',b_definition) ).
cnf(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.UOcSOPzisd/E---3.1_21127.p',n_definition) ).
cnf(prove_fixed_point,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
file('/export/starexec/sandbox2/tmp/tmp.UOcSOPzisd/E---3.1_21127.p',prove_fixed_point) ).
cnf(c_0_3,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_4,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_5,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_6,plain,
apply(apply(apply(n,b),X1),X2) = apply(X2,apply(X1,X2)),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
c_0_5 ).
cnf(c_0_8,plain,
apply(apply(apply(n,apply(n,b)),X1),X2) = apply(apply(X1,apply(X2,X1)),X2),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(n,b),X1),f(X1)) != apply(X1,f(X1)),
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
apply(apply(apply(n,apply(n,b)),apply(b,X1)),X2) = apply(X1,apply(apply(X2,apply(b,X1)),X2)),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
apply(apply(apply(apply(n,apply(n,b)),apply(b,apply(n,b))),X1),f(apply(apply(X1,apply(b,apply(n,b))),X1))) != apply(apply(apply(X1,apply(b,apply(n,b))),X1),f(apply(apply(X1,apply(b,apply(n,b))),X1))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL044-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n002.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri May 3 11:54:57 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.UOcSOPzisd/E---3.1_21127.p
% 0.19/0.52 # Version: 3.1.0
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21259 completed with status 0
% 0.19/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # No SInE strategy applied
% 0.19/0.52 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.19/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.52 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.52 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.52 # U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 21266 completed with status 0
% 0.19/0.52 # Result found by U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # No SInE strategy applied
% 0.19/0.52 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.19/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.52 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 3
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 3
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 3
% 0.19/0.52 # Processed clauses : 120
% 0.19/0.52 # ...of these trivial : 6
% 0.19/0.52 # ...subsumed : 59
% 0.19/0.52 # ...remaining for further processing : 55
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 0
% 0.19/0.52 # Backward-rewritten : 4
% 0.19/0.52 # Generated clauses : 3008
% 0.19/0.52 # ...of the previous two non-redundant : 2919
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 3007
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 1
% 0.19/0.52 # Disequality decompositions : 0
% 0.19/0.52 # Total rewrite steps : 738
% 0.19/0.52 # ...of those cached : 519
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 48
% 0.19/0.52 # Positive orientable unit clauses : 7
% 0.19/0.52 # Positive unorientable unit clauses: 22
% 0.19/0.52 # Negative unit clauses : 19
% 0.19/0.52 # Non-unit-clauses : 0
% 0.19/0.52 # Current number of unprocessed clauses: 2794
% 0.19/0.52 # ...number of literals in the above : 2794
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 7
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.52 # Non-unit clause-clause subsumptions : 0
% 0.19/0.52 # Unit Clause-clause subsumption calls : 131
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 455
% 0.19/0.52 # BW rewrite match successes : 10
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 101318
% 0.19/0.52 # Search garbage collected termcells : 2
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.038 s
% 0.19/0.52 # System time : 0.005 s
% 0.19/0.52 # Total time : 0.043 s
% 0.19/0.52 # Maximum resident set size: 1548 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.201 s
% 0.19/0.52 # System time : 0.022 s
% 0.19/0.52 # Total time : 0.223 s
% 0.19/0.52 # Maximum resident set size: 1684 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------