TSTP Solution File: SWV492+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV492+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n009.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 50.26s 6.75s
% Output : Proof 50.26s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( int_leq(int_one,sK1)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g1,plain,
( int_less(sK1,sK2)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g2,plain,
( int_leq(sK2,n)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g3,plain,
( ~ sPE(a(sK1,sK2),real_zero)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g4,plain,
( ~ int_leq(int_one,sK1)
| int_less(int_zero,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero)]) ).
cnf(g5,plain,
( sPE(a(sK3,sK4),real_zero)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g6,plain,
( int_leq(int_one,sK3)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g7,plain,
( ~ int_less(sK1,sK2)
| sPE(plus(sK1,sK0(sK1,sK2)),sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g8,plain,
( ~ int_leq(sK2,n)
| sPE(sK2,n)
| int_less(sK2,n) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g9,plain,
( sPE(sK3,sK4)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g10,plain,
( int_leq(sK4,n)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lti)]) ).
cnf(g11,plain,
( int_leq(sK1,sK1)
| int_less(sK1,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_total)]) ).
cnf(g12,plain,
( int_leq(sK1,n)
| int_less(n,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_total)]) ).
cnf(g13,plain,
( ~ int_less(int_zero,sK1)
| ~ int_less(sK1,sK2)
| int_less(int_zero,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive)]) ).
cnf(g14,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ int_less(sK1,sK2)
| int_less(int_zero,sK0(sK1,sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse)]) ).
cnf(g16,plain,
( ~ sPE(sK3,sK4)
| int_leq(sK3,sK4) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g17,plain,
sPE(sK2,sK2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ int_less(int_zero,sK2)
| int_leq(int_one,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero)]) ).
cnf(g19,plain,
sPE(int_one,int_one),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ int_less(sK2,n)
| ~ int_less(n,sK1)
| int_less(sK2,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive)]) ).
cnf(g21,plain,
sPE(plus(sK1,int_zero),sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_zero)]) ).
cnf(g22,plain,
( ~ sPE(int_one,int_one)
| ~ sPE(sK3,sK4)
| ~ int_leq(int_one,sK3)
| int_leq(int_one,sK4) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(plus(sK1,sK0(sK1,sK2)),sK2)
| sPE(sK2,plus(sK1,sK0(sK1,sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(sK1,sK1)
| ~ int_less(sK1,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_irreflexive)]) ).
cnf(g25,plain,
( ~ sPE(plus(sK1,int_zero),sK1)
| sPE(sK1,plus(sK1,int_zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
sPE(sK3,sK3),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(plus(sK1,int_zero),sK1)
| ~ sPE(sK2,n)
| ~ int_leq(plus(sK1,int_zero),sK2)
| int_leq(sK1,n) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
~ sPE(real_zero,real_one),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_constants)]) ).
cnf(g29,plain,
( ~ int_leq(sK4,n)
| ~ int_leq(sK4,n)
| ~ int_leq(sK3,sK4)
| ~ int_leq(int_one,sK4)
| ~ int_leq(int_one,sK4)
| ~ int_leq(int_one,sK3)
| sPE(a(sK3,sK3),real_one) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qih)]) ).
cnf(g30,plain,
( ~ sPE(sK1,plus(sK1,int_zero))
| ~ sPE(sK2,sK2)
| ~ int_less(sK1,sK2)
| int_less(plus(sK1,int_zero),sK2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ int_less(plus(sK1,int_zero),sK2)
| int_leq(plus(sK1,int_zero),sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g32,plain,
( ~ int_less(sK1,sK2)
| ~ int_less(sK2,sK1)
| int_less(sK1,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive)]) ).
cnf(g33,plain,
( ~ sPE(real_zero,a(sK3,sK3))
| ~ sPE(a(sK3,sK3),real_one)
| sPE(real_zero,real_one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g34,plain,
( ~ sPE(a(sK3,sK3),real_zero)
| sPE(real_zero,a(sK3,sK3)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g35,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/sandbox2/benchmark/theBenchmark.p',qih)]) ).
cnf(g36,plain,
( ~ sPE(a(sK3,sK3),a(sK3,sK4))
| ~ sPE(a(sK3,sK4),real_zero)
| sPE(a(sK3,sK3),real_zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g37,plain,
( ~ sPE(sK3,sK3)
| ~ sPE(sK3,sK4)
| sPE(a(sK3,sK3),a(sK3,sK4)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g38,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(g39,plain,
( ~ sPE(a(sK1,plus(sK1,sK0(sK1,sK2))),a(sK1,sK2))
| sPE(a(sK1,sK2),a(sK1,plus(sK1,sK0(sK1,sK2)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g40,plain,
( ~ sPE(sK1,sK1)
| ~ sPE(plus(sK1,sK0(sK1,sK2)),sK2)
| sPE(a(sK1,plus(sK1,sK0(sK1,sK2))),a(sK1,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV492+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n009.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 16 03:37:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 50.26/6.75 % symbols: 18
% 50.26/6.75 % clauses: 36
% 50.26/6.75 % start clauses: 4
% 50.26/6.75 % iterative deepening steps: 752
% 50.26/6.75 % maximum path limit: 4
% 50.26/6.75 % literal attempts: 1525288
% 50.26/6.75 % depth failures: 1228210
% 50.26/6.75 % regularity failures: 36873
% 50.26/6.75 % tautology failures: 30021
% 50.26/6.75 % reductions: 59239
% 50.26/6.75 % extensions: 1464358
% 50.26/6.75 % SAT variables: 129099
% 50.26/6.75 % SAT clauses: 165927
% 50.26/6.75 % WalkSAT solutions: 162977
% 50.26/6.75 % CDCL solutions: 2943
% 50.26/6.75 % SZS status Theorem for theBenchmark
% 50.26/6.75 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------