TSTP Solution File: COL042-4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL042-4 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:42 EDT 2024
% Result : Unsatisfiable 5.15s 1.10s
% Output : CNFRefutation 5.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 14 unt; 0 nHn; 9 RR)
% Number of literals : 20 ( 13 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(w1_definition,axiom,
apply(apply(w1,X1),X2) = apply(apply(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.w3VNVEC4Tm/E---3.1_12116.p',w1_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.w3VNVEC4Tm/E---3.1_12116.p',b_definition) ).
cnf(prove_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(w1,w1)),apply(apply(b,apply(b,w1)),b))),b)),
file('/export/starexec/sandbox/tmp/tmp.w3VNVEC4Tm/E---3.1_12116.p',prove_strong_fixed_point) ).
cnf(strong_fixed_point,axiom,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
file('/export/starexec/sandbox/tmp/tmp.w3VNVEC4Tm/E---3.1_12116.p',strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(w1,X1),X2) = apply(apply(X2,X1),X1),
w1_definition ).
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,
~ fixed_point(apply(apply(b,apply(apply(b,apply(w1,w1)),apply(apply(b,apply(b,w1)),b))),b)),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_7,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
inference(fof_simplification,[status(thm)],[strong_fixed_point]) ).
cnf(c_0_8,plain,
apply(apply(w1,X1),apply(apply(b,X2),X3)) = apply(apply(X2,apply(X3,X1)),X1),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(w1,w1)),apply(apply(b,apply(b,w1)),b))),b)),
c_0_6 ).
cnf(c_0_10,plain,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
c_0_7 ).
cnf(c_0_11,plain,
apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(X3,X1),X1)),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
apply(fixed_pt,apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,fixed_pt))))) != apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]) ).
cnf(c_0_13,plain,
apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(w1,X1),X3)),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_14,negated_conjecture,
apply(fixed_pt,apply(apply(w1,apply(apply(b,apply(b,fixed_pt)),w1)),w1)) != apply(apply(w1,apply(apply(b,apply(b,fixed_pt)),w1)),w1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_8]) ).
cnf(c_0_15,plain,
apply(X1,apply(apply(w1,apply(apply(b,apply(b,X1)),X2)),X2)) = apply(apply(w1,apply(apply(b,apply(b,X1)),X2)),w1),
inference(spm,[status(thm)],[c_0_4,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.10/0.12 % Problem : COL042-4 : TPTP v8.1.2. Released v1.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 11:38:44 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 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.w3VNVEC4Tm/E---3.1_12116.p
% 5.15/1.10 # Version: 3.1.0
% 5.15/1.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.15/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.15/1.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.15/1.10 # Starting new_bool_3 with 300s (1) cores
% 5.15/1.10 # Starting new_bool_1 with 300s (1) cores
% 5.15/1.10 # Starting sh5l with 300s (1) cores
% 5.15/1.10 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12193 completed with status 0
% 5.15/1.10 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.15/1.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.15/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.15/1.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.15/1.10 # No SInE strategy applied
% 5.15/1.10 # Search class: FHUSS-FFSF22-DFFFFFNN
% 5.15/1.10 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.15/1.10 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 5.15/1.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.15/1.10 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 5.15/1.10 # Starting new_bool_3 with 136s (1) cores
% 5.15/1.10 # Starting new_bool_1 with 136s (1) cores
% 5.15/1.10 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 12202 completed with status 0
% 5.15/1.10 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 5.15/1.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.15/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.15/1.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.15/1.10 # No SInE strategy applied
% 5.15/1.10 # Search class: FHUSS-FFSF22-DFFFFFNN
% 5.15/1.10 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.15/1.10 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 5.15/1.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.15/1.10 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 5.15/1.10 # Preprocessing time : 0.001 s
% 5.15/1.10 # Presaturation interreduction done
% 5.15/1.10
% 5.15/1.10 # Proof found!
% 5.15/1.10 # SZS status Unsatisfiable
% 5.15/1.10 # SZS output start CNFRefutation
% See solution above
% 5.15/1.10 # Parsed axioms : 4
% 5.15/1.10 # Removed by relevancy pruning/SinE : 0
% 5.15/1.10 # Initial clauses : 4
% 5.15/1.10 # Removed in clause preprocessing : 0
% 5.15/1.10 # Initial clauses in saturation : 4
% 5.15/1.10 # Processed clauses : 932
% 5.15/1.10 # ...of these trivial : 360
% 5.15/1.10 # ...subsumed : 155
% 5.15/1.10 # ...remaining for further processing : 417
% 5.15/1.10 # Other redundant clauses eliminated : 0
% 5.15/1.10 # Clauses deleted for lack of memory : 0
% 5.15/1.10 # Backward-subsumed : 2
% 5.15/1.10 # Backward-rewritten : 60
% 5.15/1.10 # Generated clauses : 34034
% 5.15/1.10 # ...of the previous two non-redundant : 32665
% 5.15/1.10 # ...aggressively subsumed : 0
% 5.15/1.10 # Contextual simplify-reflections : 0
% 5.15/1.10 # Paramodulations : 34034
% 5.15/1.10 # Factorizations : 0
% 5.15/1.10 # NegExts : 0
% 5.15/1.10 # Equation resolutions : 0
% 5.15/1.10 # Disequality decompositions : 0
% 5.15/1.10 # Total rewrite steps : 32083
% 5.15/1.10 # ...of those cached : 24982
% 5.15/1.10 # Propositional unsat checks : 0
% 5.15/1.10 # Propositional check models : 0
% 5.15/1.10 # Propositional check unsatisfiable : 0
% 5.15/1.10 # Propositional clauses : 0
% 5.15/1.10 # Propositional clauses after purity: 0
% 5.15/1.10 # Propositional unsat core size : 0
% 5.15/1.10 # Propositional preprocessing time : 0.000
% 5.15/1.10 # Propositional encoding time : 0.000
% 5.15/1.10 # Propositional solver time : 0.000
% 5.15/1.10 # Success case prop preproc time : 0.000
% 5.15/1.10 # Success case prop encoding time : 0.000
% 5.15/1.10 # Success case prop solver time : 0.000
% 5.15/1.10 # Current number of processed clauses : 351
% 5.15/1.10 # Positive orientable unit clauses : 304
% 5.15/1.10 # Positive unorientable unit clauses: 45
% 5.15/1.10 # Negative unit clauses : 1
% 5.15/1.10 # Non-unit-clauses : 1
% 5.15/1.10 # Current number of unprocessed clauses: 31625
% 5.15/1.10 # ...number of literals in the above : 31625
% 5.15/1.10 # Current number of archived formulas : 0
% 5.15/1.10 # Current number of archived clauses : 66
% 5.15/1.10 # Clause-clause subsumption calls (NU) : 0
% 5.15/1.10 # Rec. Clause-clause subsumption calls : 0
% 5.15/1.10 # Non-unit clause-clause subsumptions : 0
% 5.15/1.10 # Unit Clause-clause subsumption calls : 4522
% 5.15/1.10 # Rewrite failures with RHS unbound : 0
% 5.15/1.10 # BW rewrite match attempts : 10527
% 5.15/1.10 # BW rewrite match successes : 355
% 5.15/1.10 # Condensation attempts : 0
% 5.15/1.10 # Condensation successes : 0
% 5.15/1.10 # Termbank termtop insertions : 1338874
% 5.15/1.10 # Search garbage collected termcells : 5
% 5.15/1.10
% 5.15/1.10 # -------------------------------------------------
% 5.15/1.10 # User time : 0.570 s
% 5.15/1.10 # System time : 0.021 s
% 5.15/1.10 # Total time : 0.591 s
% 5.15/1.10 # Maximum resident set size: 1596 pages
% 5.15/1.10
% 5.15/1.10 # -------------------------------------------------
% 5.15/1.10 # User time : 2.950 s
% 5.15/1.10 # System time : 0.068 s
% 5.15/1.10 # Total time : 3.018 s
% 5.15/1.10 # Maximum resident set size: 1692 pages
% 5.15/1.10 % E---3.1 exiting
%------------------------------------------------------------------------------