TSTP Solution File: SWV491+3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV491+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% 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 : 600s
% DateTime : Wed Jul 20 21:29:28 EDT 2022
% Result : Theorem 20.14s 3.00s
% Output : Proof 20.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
int_leq(int_one,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g1,plain,
int_leq(sK1,n),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g2,plain,
int_leq(int_one,sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g3,plain,
int_leq(sK2,n),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g4,plain,
( int_less(sK1,sK2)
| sP0
| sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g5,plain,
( ~ sPE(a(sK1,sK2),real_zero)
| sP0
| sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g6,plain,
( ~ int_leq(sK2,n)
| ~ int_leq(sK2,n)
| ~ int_leq(sK2,sK2)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,sK2)
| sPE(a(sK2,sK2),real_one) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',qih)]) ).
cnf(g7,plain,
( ~ int_leq(int_one,sK2)
| int_less(int_zero,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero)]) ).
cnf(g8,plain,
( ~ sPE(a(sK1,sK2),real_one)
| ~ sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g9,plain,
( sPE(sK1,sK2)
| ~ sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g10,plain,
( int_less(sK2,sK1)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g11,plain,
( ~ sPE(a(sK1,sK2),real_zero)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',diag)]) ).
cnf(g12,plain,
( ~ int_less(sK1,sK2)
| sPE(plus(sK1,sK0(sK1,sK2)),sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g13,plain,
( ~ sPE(sK2,sK1)
| sPE(sK1,sK2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ int_less(int_zero,sK2)
| sPE(plus(int_zero,sK0(int_zero,sK2)),sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g16,plain,
sPE(sK2,sK2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(sK1,sK2)
| ~ int_less(sK1,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive)]) ).
cnf(g18,plain,
( ~ sPE(sK1,sK2)
| sPE(sK2,sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(sK2,sK1)
| ~ int_less(sK2,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive)]) ).
cnf(g20,plain,
( ~ int_less(sK2,sK1)
| sPE(plus(sK2,sK0(sK2,sK1)),sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g21,plain,
( ~ int_less(sK2,sK1)
| int_less(int_zero,sK0(sK2,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g22,plain,
( ~ int_leq(sK2,sK1)
| sPE(sK2,sK1)
| int_less(sK2,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g23,plain,
( ~ sPE(sK1,sK2)
| ~ sPE(sK2,sK2)
| sPE(a(sK1,sK2),a(sK2,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ int_less(sK1,sK2)
| int_less(int_zero,sK0(sK1,sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g25,plain,
( ~ sPE(plus(int_zero,sK0(int_zero,sK2)),sK2)
| int_leq(plus(int_zero,sK0(int_zero,sK2)),sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g26,plain,
( ~ sPE(plus(int_zero,sK0(int_zero,sK2)),sK2)
| ~ sPE(sK2,sK2)
| ~ int_leq(plus(int_zero,sK0(int_zero,sK2)),sK2)
| int_leq(sK2,sK2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(a(sK1,sK2),a(sK2,sK2))
| ~ sPE(a(sK2,sK2),real_one)
| sPE(a(sK1,sK2),real_one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( int_leq(sK2,sK1)
| int_less(sK1,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total)]) ).
cnf(g29,plain,
( ~ sPE(plus(sK2,sK0(sK2,sK1)),sK1)
| ~ sPE(sK2,sK2)
| sPE(a(plus(sK2,sK0(sK2,sK1)),sK2),a(sK1,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g30,plain,
( ~ sPE(plus(sK2,sK0(sK2,sK1)),sK1)
| sPE(sK1,plus(sK2,sK0(sK2,sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ sPE(sK1,sK1)
| int_leq(sK1,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g32,plain,
( ~ sPE(plus(sK1,sK0(sK1,sK2)),sK2)
| sPE(sK2,plus(sK1,sK0(sK1,sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g33,plain,
( ~ sPE(sK1,plus(sK2,sK0(sK2,sK1)))
| ~ int_leq(sK1,n)
| ~ int_leq(sK2,n)
| ~ int_leq(sK2,sK2)
| ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,sK2)
| ~ int_less(int_zero,sK0(sK2,sK1))
| sPE(a(plus(sK2,sK0(sK2,sK1)),sK2),real_zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',qih)]) ).
cnf(g34,plain,
( ~ sPE(a(sK1,sK2),a(plus(sK2,sK0(sK2,sK1)),sK2))
| ~ sPE(a(plus(sK2,sK0(sK2,sK1)),sK2),real_zero)
| sPE(a(sK1,sK2),real_zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g35,plain,
( ~ sPE(a(plus(sK2,sK0(sK2,sK1)),sK2),a(sK1,sK2))
| sPE(a(sK1,sK2),a(plus(sK2,sK0(sK2,sK1)),sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g36,plain,
( ~ sPE(sK2,plus(sK1,sK0(sK1,sK2)))
| ~ int_leq(sK1,n)
| ~ int_leq(sK2,n)
| ~ int_leq(sK1,sK1)
| ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| sPE(a(sK1,plus(sK1,sK0(sK1,sK2))),real_zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',qih)]) ).
cnf(g37,plain,
( ~ sPE(a(sK1,sK2),a(sK1,plus(sK1,sK0(sK1,sK2))))
| ~ sPE(a(sK1,plus(sK1,sK0(sK1,sK2))),real_zero)
| sPE(a(sK1,sK2),real_zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g38,plain,
( ~ sPE(sK1,sK1)
| ~ sPE(sK2,plus(sK1,sK0(sK1,sK2)))
| sPE(a(sK1,sK2),a(sK1,plus(sK1,sK0(sK1,sK2)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV491+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : satcop --statistics %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 10:55:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 20.14/3.00 % symbols: 16
% 20.14/3.00 % clauses: 37
% 20.14/3.00 % start clauses: 6
% 20.14/3.00 % iterative deepening steps: 1247
% 20.14/3.00 % maximum path limit: 4
% 20.14/3.00 % literal attempts: 5371127
% 20.14/3.00 % depth failures: 4510711
% 20.14/3.00 % regularity failures: 142511
% 20.14/3.00 % tautology failures: 168078
% 20.14/3.00 % reductions: 66462
% 20.14/3.00 % extensions: 5300536
% 20.14/3.00 % SAT variables: 125908
% 20.14/3.00 % SAT clauses: 181463
% 20.14/3.00 % WalkSAT solutions: 180947
% 20.14/3.00 % CDCL solutions: 513
% 20.14/3.00 % SZS status Theorem for theBenchmark
% 20.14/3.00 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------