TSTP Solution File: GRP188-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP188-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n014.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:45 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(least_upper_bound(b,least_upper_bound(a,b)),least_upper_bound(a,b)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p38a)]) ).
cnf(g1,plain,
sPE(least_upper_bound(b,b),b),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',idempotence_of_lub)]) ).
cnf(g2,plain,
sPE(least_upper_bound(least_upper_bound(a,b),b),least_upper_bound(b,least_upper_bound(a,b))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_lub)]) ).
cnf(g3,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(least_upper_bound(a,least_upper_bound(b,b)),least_upper_bound(least_upper_bound(a,b),b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',associativity_of_lub)]) ).
cnf(g5,plain,
( ~ sPE(least_upper_bound(a,least_upper_bound(b,b)),least_upper_bound(least_upper_bound(a,b),b))
| ~ sPE(least_upper_bound(least_upper_bound(a,b),b),least_upper_bound(b,least_upper_bound(a,b)))
| sPE(least_upper_bound(a,least_upper_bound(b,b)),least_upper_bound(b,least_upper_bound(a,b))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(least_upper_bound(b,least_upper_bound(a,b)),least_upper_bound(a,least_upper_bound(b,b)))
| ~ sPE(least_upper_bound(a,least_upper_bound(b,b)),least_upper_bound(a,b))
| sPE(least_upper_bound(b,least_upper_bound(a,b)),least_upper_bound(a,b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(a,a)
| ~ sPE(least_upper_bound(b,b),b)
| sPE(least_upper_bound(a,least_upper_bound(b,b)),least_upper_bound(a,b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(least_upper_bound(a,least_upper_bound(b,b)),least_upper_bound(b,least_upper_bound(a,b)))
| sPE(least_upper_bound(b,least_upper_bound(a,b)),least_upper_bound(a,least_upper_bound(b,b))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP188-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 04:43:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 % symbols: 9
% 0.13/0.37 % clauses: 26
% 0.13/0.37 % start clauses: 1
% 0.13/0.37 % iterative deepening steps: 386
% 0.13/0.37 % maximum path limit: 5
% 0.13/0.37 % literal attempts: 17712
% 0.13/0.37 % depth failures: 7495
% 0.13/0.37 % regularity failures: 1842
% 0.13/0.37 % tautology failures: 941
% 0.13/0.37 % reductions: 0
% 0.13/0.37 % extensions: 17375
% 0.13/0.37 % SAT variables: 4206
% 0.13/0.37 % SAT clauses: 6652
% 0.13/0.37 % WalkSAT solutions: 6645
% 0.13/0.37 % CDCL solutions: 0
% 0.13/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------