TSTP Solution File: COL002-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL002-2 : TPTP v8.2.0. Released v1.0.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 : Mon May 20 19:02:44 EDT 2024
% Result : Unsatisfiable 6.33s 1.32s
% Output : CNFRefutation 6.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 28 ( 21 unt; 0 nHn; 13 RR)
% Number of literals : 35 ( 22 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(weak_fixed_point,axiom,
( fixed_point(X1)
| X1 != apply(fixed_pt,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',weak_fixed_point) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(c_definition,axiom,
apply(apply(apply(c,X1),X2),X3) = apply(apply(X1,X3),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_definition) ).
cnf(i_definition,axiom,
apply(i,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i_definition) ).
cnf(s_definition,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_definition) ).
cnf(prove_weak_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_weak_fixed_point) ).
cnf(c_0_6,plain,
( fixed_point(X1)
| X1 != apply(fixed_pt,X1) ),
inference(fof_simplification,[status(thm)],[weak_fixed_point]) ).
cnf(c_0_7,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_8,axiom,
apply(apply(apply(c,X1),X2),X3) = apply(apply(X1,X3),X2),
c_definition ).
cnf(c_0_9,axiom,
apply(i,X1) = X1,
i_definition ).
cnf(c_0_10,plain,
( fixed_point(X1)
| X1 != apply(fixed_pt,X1) ),
c_0_6 ).
cnf(c_0_11,plain,
apply(apply(apply(c,apply(b,X1)),X2),X3) = apply(X1,apply(X3,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
apply(apply(apply(c,i),X1),X2) = apply(X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
s_definition ).
cnf(c_0_14,plain,
( fixed_point(apply(X1,X2))
| apply(apply(apply(c,apply(b,fixed_pt)),X2),X1) != apply(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
apply(apply(apply(c,i),X1),apply(apply(c,X2),X3)) = apply(apply(X2,X1),X3),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_16,plain,
apply(apply(apply(c,apply(b,X1)),X2),apply(apply(c,i),X3)) = apply(X1,apply(X2,X3)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
apply(apply(apply(s,X1),i),X2) = apply(apply(X1,X2),X2),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
~ fixed_point(apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))),
inference(fof_simplification,[status(thm)],[prove_weak_fixed_point]) ).
cnf(c_0_19,plain,
( fixed_point(apply(apply(X1,X2),X3))
| apply(fixed_pt,apply(apply(apply(c,X1),X3),X2)) != apply(apply(X1,X2),X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
apply(apply(apply(c,apply(s,X1)),X2),i) = apply(apply(X1,X2),X2),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,plain,
apply(apply(apply(c,apply(c,X1)),X2),X3) = apply(apply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_22,negated_conjecture,
~ fixed_point(apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))),
c_0_18 ).
cnf(c_0_23,plain,
( fixed_point(apply(apply(X1,X2),X2))
| apply(fixed_pt,apply(apply(apply(s,X1),i),X2)) != apply(apply(X1,X2),X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ fixed_point(apply(apply(apply(c,i),i),apply(apply(c,apply(s,apply(b,X1))),apply(apply(s,apply(b,X1)),i)))),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_25,plain,
( fixed_point(apply(X1,apply(X2,X2)))
| apply(fixed_pt,apply(apply(apply(s,apply(b,X1)),i),X2)) != apply(X1,apply(X2,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_7]) ).
cnf(c_0_26,negated_conjecture,
~ fixed_point(apply(X1,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_8]),c_0_9]),c_0_20]),c_0_7]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COL002-2 : TPTP v8.2.0. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 13:02:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.48 Running first-order model finding
% 0.22/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/benchmark/theBenchmark.p
% 6.33/1.31 # Version: 3.1.0
% 6.33/1.31 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.33/1.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.33/1.31 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.33/1.31 # Starting new_bool_3 with 300s (1) cores
% 6.33/1.31 # Starting new_bool_1 with 300s (1) cores
% 6.33/1.31 # Starting sh5l with 300s (1) cores
% 6.33/1.31 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5686 completed with status 0
% 6.33/1.31 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.33/1.31 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.33/1.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.33/1.31 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.33/1.31 # No SInE strategy applied
% 6.33/1.31 # Search class: FHUSM-FFSF22-MFFFFFNN
% 6.33/1.31 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.33/1.31 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 6.33/1.31 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.33/1.31 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 6.33/1.31 # Starting new_bool_3 with 136s (1) cores
% 6.33/1.31 # Starting new_bool_1 with 136s (1) cores
% 6.33/1.31 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 5690 completed with status 0
% 6.33/1.32 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 6.33/1.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.33/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.33/1.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.33/1.32 # No SInE strategy applied
% 6.33/1.32 # Search class: FHUSM-FFSF22-MFFFFFNN
% 6.33/1.32 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.33/1.32 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 6.33/1.32 # Preprocessing time : 0.001 s
% 6.33/1.32
% 6.33/1.32 # Proof found!
% 6.33/1.32 # SZS status Unsatisfiable
% 6.33/1.32 # SZS output start CNFRefutation
% See solution above
% 6.33/1.32 # Parsed axioms : 6
% 6.33/1.32 # Removed by relevancy pruning/SinE : 0
% 6.33/1.32 # Initial clauses : 6
% 6.33/1.32 # Removed in clause preprocessing : 0
% 6.33/1.32 # Initial clauses in saturation : 6
% 6.33/1.32 # Processed clauses : 1418
% 6.33/1.32 # ...of these trivial : 40
% 6.33/1.32 # ...subsumed : 1033
% 6.33/1.32 # ...remaining for further processing : 345
% 6.33/1.32 # Other redundant clauses eliminated : 0
% 6.33/1.32 # Clauses deleted for lack of memory : 0
% 6.33/1.32 # Backward-subsumed : 1
% 6.33/1.32 # Backward-rewritten : 77
% 6.33/1.32 # Generated clauses : 32040
% 6.33/1.32 # ...of the previous two non-redundant : 31636
% 6.33/1.32 # ...aggressively subsumed : 0
% 6.33/1.32 # Contextual simplify-reflections : 0
% 6.33/1.32 # Paramodulations : 32035
% 6.33/1.32 # Factorizations : 0
% 6.33/1.32 # NegExts : 0
% 6.33/1.32 # Equation resolutions : 5
% 6.33/1.32 # Disequality decompositions : 0
% 6.33/1.32 # Total rewrite steps : 17918
% 6.33/1.32 # ...of those cached : 9981
% 6.33/1.32 # Propositional unsat checks : 0
% 6.33/1.32 # Propositional check models : 0
% 6.33/1.32 # Propositional check unsatisfiable : 0
% 6.33/1.32 # Propositional clauses : 0
% 6.33/1.32 # Propositional clauses after purity: 0
% 6.33/1.32 # Propositional unsat core size : 0
% 6.33/1.32 # Propositional preprocessing time : 0.000
% 6.33/1.32 # Propositional encoding time : 0.000
% 6.33/1.32 # Propositional solver time : 0.000
% 6.33/1.32 # Success case prop preproc time : 0.000
% 6.33/1.32 # Success case prop encoding time : 0.000
% 6.33/1.32 # Success case prop solver time : 0.000
% 6.33/1.32 # Current number of processed clauses : 267
% 6.33/1.32 # Positive orientable unit clauses : 66
% 6.33/1.32 # Positive unorientable unit clauses: 49
% 6.33/1.32 # Negative unit clauses : 106
% 6.33/1.32 # Non-unit-clauses : 46
% 6.33/1.32 # Current number of unprocessed clauses: 30012
% 6.33/1.32 # ...number of literals in the above : 37238
% 6.33/1.32 # Current number of archived formulas : 0
% 6.33/1.32 # Current number of archived clauses : 78
% 6.33/1.32 # Clause-clause subsumption calls (NU) : 1449
% 6.33/1.32 # Rec. Clause-clause subsumption calls : 1449
% 6.33/1.32 # Non-unit clause-clause subsumptions : 515
% 6.33/1.32 # Unit Clause-clause subsumption calls : 1023
% 6.33/1.32 # Rewrite failures with RHS unbound : 0
% 6.33/1.32 # BW rewrite match attempts : 13458
% 6.33/1.32 # BW rewrite match successes : 3805
% 6.33/1.32 # Condensation attempts : 0
% 6.33/1.32 # Condensation successes : 0
% 6.33/1.32 # Termbank termtop insertions : 936513
% 6.33/1.32 # Search garbage collected termcells : 5
% 6.33/1.32
% 6.33/1.32 # -------------------------------------------------
% 6.33/1.32 # User time : 0.765 s
% 6.33/1.32 # System time : 0.033 s
% 6.33/1.32 # Total time : 0.798 s
% 6.33/1.32 # Maximum resident set size: 1596 pages
% 6.33/1.32
% 6.33/1.32 # -------------------------------------------------
% 6.33/1.32 # User time : 3.930 s
% 6.33/1.32 # System time : 0.083 s
% 6.33/1.32 # Total time : 4.013 s
% 6.33/1.32 # Maximum resident set size: 1692 pages
% 6.33/1.32 % E---3.1 exiting
%------------------------------------------------------------------------------