TSTP Solution File: GRP141-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n006.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:27 EDT 2022
% Result : Unsatisfiable 187.22s 23.87s
% Output : Proof 187.56s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(greatest_lower_bound(greatest_lower_bound(a,b),c),c),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1d)]) ).
cnf(g1,plain,
( ~ sPE(c,greatest_lower_bound(greatest_lower_bound(a,b),c))
| sPE(greatest_lower_bound(greatest_lower_bound(a,b),c),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(c,greatest_lower_bound(a,b))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
cnf(g3,plain,
sPE(multiply(identity,c),c),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).
cnf(g4,plain,
sPE(greatest_lower_bound(c,greatest_lower_bound(a,b)),greatest_lower_bound(greatest_lower_bound(c,a),b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',associativity_of_glb)]) ).
cnf(g5,plain,
sPE(c,c),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(greatest_lower_bound(a,b),c)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',idempotence_of_gld)]) ).
cnf(g7,plain,
sPE(least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b)),greatest_lower_bound(a,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',idempotence_of_lub)]) ).
cnf(g8,plain,
( ~ sPE(c,greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(greatest_lower_bound(a,b),c))
| sPE(c,greatest_lower_bound(greatest_lower_bound(a,b),c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),c)
| sPE(c,greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(greatest_lower_bound(a,b),c))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(c,greatest_lower_bound(a,b)))
| sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(c,greatest_lower_bound(a,b))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(multiply(inverse(c),c),identity),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_inverse)]) ).
cnf(g12,plain,
sPE(least_upper_bound(a,c),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1d_1)]) ).
cnf(g13,plain,
( ~ sPE(c,c)
| ~ sPE(least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b)),greatest_lower_bound(a,b))
| sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),greatest_lower_bound(c,greatest_lower_bound(a,b))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),greatest_lower_bound(c,greatest_lower_bound(a,b)))
| sPE(greatest_lower_bound(c,greatest_lower_bound(a,b)),greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(least_upper_bound(b,c),b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1d_2)]) ).
cnf(g16,plain,
( ~ sPE(least_upper_bound(b,c),b)
| sPE(b,least_upper_bound(b,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
sPE(least_upper_bound(b,c),least_upper_bound(c,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_lub)]) ).
cnf(g18,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(c,greatest_lower_bound(a,b)))
| ~ sPE(greatest_lower_bound(c,greatest_lower_bound(a,b)),c)
| sPE(greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(greatest_lower_bound(a,b),c)),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(greatest_lower_bound(c,greatest_lower_bound(a,b)),greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))))
| ~ sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),c)
| sPE(greatest_lower_bound(c,greatest_lower_bound(a,b)),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
sPE(least_upper_bound(c,a),least_upper_bound(a,c)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_lub)]) ).
cnf(g21,plain,
( ~ sPE(multiply(inverse(c),c),identity)
| sPE(identity,multiply(inverse(c),c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(least_upper_bound(c,a),least_upper_bound(a,c))
| ~ sPE(least_upper_bound(a,c),a)
| sPE(least_upper_bound(c,a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),greatest_lower_bound(c,greatest_lower_bound(a,b)))
| ~ sPE(greatest_lower_bound(c,greatest_lower_bound(a,b)),greatest_lower_bound(greatest_lower_bound(c,a),b))
| sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),greatest_lower_bound(greatest_lower_bound(c,a),b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(least_upper_bound(c,a),a)
| sPE(a,least_upper_bound(c,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),greatest_lower_bound(greatest_lower_bound(c,a),b))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(c,a),b),c)
| sPE(greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(a,b))),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(c,c)
| ~ sPE(a,least_upper_bound(c,a))
| sPE(greatest_lower_bound(c,a),greatest_lower_bound(c,least_upper_bound(c,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(c,a),b),greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)),c)
| sPE(greatest_lower_bound(greatest_lower_bound(c,a),b),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(greatest_lower_bound(c,a),greatest_lower_bound(c,least_upper_bound(c,a)))
| ~ sPE(b,least_upper_bound(b,c))
| sPE(greatest_lower_bound(greatest_lower_bound(c,a),b),greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)),multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))))
| ~ sPE(multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),c)
| sPE(greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g30,plain,
( ~ sPE(multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)))
| sPE(greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)),multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
sPE(multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).
cnf(g32,plain,
( ~ sPE(greatest_lower_bound(c,least_upper_bound(c,a)),c)
| ~ sPE(least_upper_bound(b,c),least_upper_bound(c,b))
| sPE(greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)),greatest_lower_bound(c,least_upper_bound(c,b))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g33,plain,
sPE(greatest_lower_bound(c,least_upper_bound(c,a)),c),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',glb_absorbtion)]) ).
cnf(g34,plain,
( ~ sPE(multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),multiply(multiply(inverse(c),c),greatest_lower_bound(c,least_upper_bound(c,b))))
| ~ sPE(multiply(multiply(inverse(c),c),greatest_lower_bound(c,least_upper_bound(c,b))),c)
| sPE(multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g35,plain,
( ~ sPE(identity,multiply(inverse(c),c))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c)),greatest_lower_bound(c,least_upper_bound(c,b)))
| sPE(multiply(identity,greatest_lower_bound(greatest_lower_bound(c,least_upper_bound(c,a)),least_upper_bound(b,c))),multiply(multiply(inverse(c),c),greatest_lower_bound(c,least_upper_bound(c,b)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g36,plain,
( ~ sPE(multiply(multiply(inverse(c),c),greatest_lower_bound(c,least_upper_bound(c,b))),multiply(identity,c))
| ~ sPE(multiply(identity,c),c)
| sPE(multiply(multiply(inverse(c),c),greatest_lower_bound(c,least_upper_bound(c,b))),c) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g37,plain,
( ~ sPE(multiply(inverse(c),c),identity)
| ~ sPE(greatest_lower_bound(c,least_upper_bound(c,b)),c)
| sPE(multiply(multiply(inverse(c),c),greatest_lower_bound(c,least_upper_bound(c,b))),multiply(identity,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g38,plain,
sPE(greatest_lower_bound(c,least_upper_bound(c,b)),c),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',glb_absorbtion)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 02:06:11 EDT 2022
% 0.14/0.34 % CPUTime :
% 187.22/23.87 % symbols: 10
% 187.22/23.87 % clauses: 25
% 187.22/23.87 % start clauses: 1
% 187.22/23.87 % iterative deepening steps: 37800
% 187.22/23.87 % maximum path limit: 9
% 187.22/23.87 % literal attempts: 8810184
% 187.22/23.87 % depth failures: 2274744
% 187.22/23.87 % regularity failures: 1207475
% 187.22/23.87 % tautology failures: 692301
% 187.22/23.87 % reductions: 0
% 187.22/23.87 % extensions: 8772395
% 187.22/23.87 % SAT variables: 3843495
% 187.22/23.87 % SAT clauses: 6162438
% 187.22/23.87 % WalkSAT solutions: 6162437
% 187.22/23.87 % CDCL solutions: 0
% 187.22/23.87 % SZS status Unsatisfiable for theBenchmark
% 187.22/23.87 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------