%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n010.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 : Sat Jul 16 11:32:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))),multiply(inverse(c),multiply(b,c))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p01a)]) ).
cnf(g1,plain,
( ~ sPE(multiply(inverse(c),multiply(b,c)),least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))))
| sPE(least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))),multiply(inverse(c),multiply(b,c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(multiply(inverse(c),least_upper_bound(multiply(a,c),multiply(b,c))),least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c)))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub1)]) ).
cnf(g3,plain,
( ~ sPE(inverse(c),inverse(c))
| ~ sPE(multiply(b,c),least_upper_bound(multiply(a,c),multiply(b,c)))
| sPE(multiply(inverse(c),multiply(b,c)),multiply(inverse(c),least_upper_bound(multiply(a,c),multiply(b,c)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(inverse(c),inverse(c)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(least_upper_bound(a,b),b),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p01a_1)]) ).
cnf(g6,plain,
( ~ sPE(multiply(inverse(c),multiply(b,c)),multiply(inverse(c),least_upper_bound(multiply(a,c),multiply(b,c))))
| ~ sPE(multiply(inverse(c),least_upper_bound(multiply(a,c),multiply(b,c))),least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))))
| sPE(multiply(inverse(c),multiply(b,c)),least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(c,c),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(multiply(b,c),multiply(least_upper_bound(a,b),c))
| ~ sPE(multiply(least_upper_bound(a,b),c),least_upper_bound(multiply(a,c),multiply(b,c)))
| sPE(multiply(b,c),least_upper_bound(multiply(a,c),multiply(b,c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
sPE(multiply(least_upper_bound(a,b),c),least_upper_bound(multiply(a,c),multiply(b,c))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub2)]) ).
cnf(g10,plain,
( ~ sPE(multiply(least_upper_bound(a,b),c),multiply(b,c))
| sPE(multiply(b,c),multiply(least_upper_bound(a,b),c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(least_upper_bound(a,b),b)
| ~ sPE(c,c)
| sPE(multiply(least_upper_bound(a,b),c),multiply(b,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n010.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 : Mon Jun 13 23:51:54 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.20/0.44 % symbols: 10
% 0.20/0.44 % clauses: 24
% 0.20/0.44 % start clauses: 1
% 0.20/0.44 % iterative deepening steps: 973
% 0.20/0.44 % maximum path limit: 5
% 0.20/0.44 % literal attempts: 49246
% 0.20/0.44 % depth failures: 19373
% 0.20/0.44 % regularity failures: 5422
% 0.20/0.44 % tautology failures: 3918
% 0.20/0.44 % reductions: 0
% 0.20/0.44 % extensions: 48290
% 0.20/0.44 % SAT variables: 18766
% 0.20/0.44 % SAT clauses: 26376
% 0.20/0.44 % WalkSAT solutions: 26374
% 0.20/0.44 % CDCL solutions: 0
% 0.20/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.44 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------