%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n015.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:38 EDT 2022
% Result : Unsatisfiable 131.85s 17.08s
% Output : Proof 132.48s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),multiply(inverse(a),multiply(b,a))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p06a)]) ).
cnf(g1,plain,
sPE(greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',idempotence_of_gld)]) ).
cnf(g2,plain,
sPE(multiply(b,a),multiply(b,a)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(least_upper_bound(identity,b),b),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p06a_1)]) ).
cnf(g4,plain,
sPE(inverse(a),inverse(a)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(multiply(identity,a),a),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).
cnf(g6,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a))))
| sPE(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(least_upper_bound(identity,b),b)
| ~ sPE(a,a)
| sPE(multiply(least_upper_bound(identity,b),a),multiply(b,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(inverse(a),inverse(a))
| ~ sPE(multiply(least_upper_bound(identity,b),a),multiply(b,a))
| sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),multiply(inverse(a),multiply(b,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))))
| ~ sPE(greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),multiply(inverse(a),multiply(b,a)))
| sPE(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),multiply(inverse(a),multiply(b,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(multiply(least_upper_bound(identity,b),a),least_upper_bound(multiply(identity,a),multiply(b,a))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub2)]) ).
cnf(g12,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),multiply(inverse(a),multiply(least_upper_bound(identity,b),a)))
| ~ sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),multiply(inverse(a),multiply(b,a)))
| sPE(greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),multiply(inverse(a),multiply(b,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))))
| sPE(greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))),multiply(inverse(a),multiply(least_upper_bound(identity,b),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),least_upper_bound(identity,multiply(inverse(a),multiply(b,a))))
| ~ sPE(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))))
| sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),greatest_lower_bound(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),multiply(inverse(multiply(identity,a)),least_upper_bound(multiply(identity,a),multiply(b,a))))
| ~ sPE(multiply(inverse(multiply(identity,a)),least_upper_bound(multiply(identity,a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a))))
| sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(inverse(a),inverse(multiply(identity,a)))
| ~ sPE(multiply(least_upper_bound(identity,b),a),least_upper_bound(multiply(identity,a),multiply(b,a)))
| sPE(multiply(inverse(a),multiply(least_upper_bound(identity,b),a)),multiply(inverse(multiply(identity,a)),least_upper_bound(multiply(identity,a),multiply(b,a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(multiply(inverse(multiply(identity,a)),least_upper_bound(multiply(identity,a),multiply(b,a))),least_upper_bound(multiply(inverse(multiply(identity,a)),multiply(identity,a)),multiply(inverse(multiply(identity,a)),multiply(b,a))))
| ~ sPE(least_upper_bound(multiply(inverse(multiply(identity,a)),multiply(identity,a)),multiply(inverse(multiply(identity,a)),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a))))
| sPE(multiply(inverse(multiply(identity,a)),least_upper_bound(multiply(identity,a),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
sPE(multiply(inverse(multiply(identity,a)),least_upper_bound(multiply(identity,a),multiply(b,a))),least_upper_bound(multiply(inverse(multiply(identity,a)),multiply(identity,a)),multiply(inverse(multiply(identity,a)),multiply(b,a)))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub1)]) ).
cnf(g19,plain,
( ~ sPE(multiply(inverse(multiply(identity,a)),multiply(identity,a)),identity)
| ~ sPE(multiply(inverse(multiply(identity,a)),multiply(b,a)),multiply(inverse(a),multiply(b,a)))
| sPE(least_upper_bound(multiply(inverse(multiply(identity,a)),multiply(identity,a)),multiply(inverse(multiply(identity,a)),multiply(b,a))),least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
sPE(multiply(inverse(multiply(identity,a)),multiply(identity,a)),identity),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_inverse)]) ).
cnf(g21,plain,
( ~ sPE(multiply(inverse(a),multiply(b,a)),multiply(inverse(multiply(identity,a)),multiply(b,a)))
| sPE(multiply(inverse(multiply(identity,a)),multiply(b,a)),multiply(inverse(a),multiply(b,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(inverse(a),inverse(multiply(identity,a)))
| ~ sPE(multiply(b,a),multiply(b,a))
| sPE(multiply(inverse(a),multiply(b,a)),multiply(inverse(multiply(identity,a)),multiply(b,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(inverse(multiply(identity,a)),inverse(a))
| sPE(inverse(a),inverse(multiply(identity,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(multiply(identity,a),a)
| sPE(inverse(multiply(identity,a)),inverse(a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n015.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 11:49:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 131.85/17.08 % symbols: 9
% 131.85/17.08 % clauses: 24
% 131.85/17.08 % start clauses: 1
% 131.85/17.08 % iterative deepening steps: 11405
% 131.85/17.08 % maximum path limit: 11
% 131.85/17.08 % literal attempts: 4346464
% 131.85/17.08 % depth failures: 1489569
% 131.85/17.08 % regularity failures: 491126
% 131.85/17.08 % tautology failures: 345865
% 131.85/17.08 % reductions: 0
% 131.85/17.08 % extensions: 4336548
% 131.85/17.08 % SAT variables: 2242119
% 131.85/17.08 % SAT clauses: 3330285
% 131.85/17.08 % WalkSAT solutions: 3330282
% 131.85/17.08 % CDCL solutions: 0
% 131.85/17.08 % SZS status Unsatisfiable for theBenchmark
% 131.85/17.08 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------