TSTP Solution File: SWV488+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% 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 : 600s
% DateTime : Wed Jul 20 21:29:27 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Proof 0.19s
% 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',lti)]) ).
cnf(g1,plain,
int_leq(sK2,n),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lti)]) ).
cnf(g2,plain,
sPE(sK1,sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lti)]) ).
cnf(g3,plain,
sPE(a(sK1,sK2),real_zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lti)]) ).
cnf(g4,plain,
( ~ int_leq(int_one,sK1)
| int_less(int_zero,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero)]) ).
cnf(g5,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',qil)]) ).
cnf(g6,plain,
( ~ sPE(sK2,sK1)
| ~ sPE(sK1,sK2)
| sPE(sK2,sK2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(sK1,sK2)
| sPE(sK2,sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( int_leq(sK2,int_zero)
| int_less(int_zero,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total)]) ).
cnf(g9,plain,
( ~ sPE(sK2,sK1)
| ~ sPE(sK2,sK2)
| sPE(a(sK2,sK2),a(sK1,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(sK2,sK1)
| ~ int_less(sK2,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive)]) ).
cnf(g11,plain,
( ~ int_less(int_zero,sK2)
| int_leq(int_one,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero)]) ).
cnf(g12,plain,
( ~ sPE(int_zero,sK1)
| ~ int_less(int_zero,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive)]) ).
cnf(g13,plain,
( ~ int_less(sK2,int_zero)
| ~ int_less(int_zero,sK1)
| int_less(sK2,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive)]) ).
cnf(g14,plain,
( ~ sPE(a(sK2,sK2),a(sK1,sK2))
| ~ sPE(a(sK1,sK2),real_zero)
| sPE(a(sK2,sK2),real_zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(a(sK2,sK2),real_zero)
| sPE(real_zero,a(sK2,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(sK2,sK2)
| int_leq(sK2,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g17,plain,
( ~ sPE(sK1,int_zero)
| sPE(int_zero,sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(sK1,sK2)
| ~ sPE(sK2,int_zero)
| sPE(sK1,int_zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ int_leq(sK2,int_zero)
| sPE(sK2,int_zero)
| int_less(sK2,int_zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)]) ).
cnf(g20,plain,
( ~ sPE(real_zero,a(sK2,sK2))
| ~ sPE(a(sK2,sK2),real_one)
| sPE(real_zero,real_one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
~ sPE(real_zero,real_one),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_constants)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.33 % CPULimit : 300
% 0.19/0.33 % WCLimit : 600
% 0.19/0.33 % DateTime : Wed Jun 15 15:18:54 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.19/0.47 % symbols: 15
% 0.19/0.47 % clauses: 33
% 0.19/0.47 % start clauses: 5
% 0.19/0.47 % iterative deepening steps: 192
% 0.19/0.47 % maximum path limit: 3
% 0.19/0.47 % literal attempts: 135890
% 0.19/0.47 % depth failures: 116375
% 0.19/0.47 % regularity failures: 2182
% 0.19/0.47 % tautology failures: 1612
% 0.19/0.47 % reductions: 1357
% 0.19/0.47 % extensions: 133870
% 0.19/0.47 % SAT variables: 26399
% 0.19/0.47 % SAT clauses: 31914
% 0.19/0.47 % WalkSAT solutions: 31906
% 0.19/0.47 % CDCL solutions: 2
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------