TSTP Solution File: GRP174-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP174-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n013.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:37 EDT 2022
% Result : Unsatisfiable 34.05s 4.64s
% Output : Proof 34.05s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(identity,a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p05b)]) ).
cnf(g1,plain,
sPE(greatest_lower_bound(identity,a),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p05b_1)]) ).
cnf(g2,plain,
sPE(multiply(identity,a),a),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).
cnf(g3,plain,
sPE(multiply(inverse(a),a),identity),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_inverse)]) ).
cnf(g4,plain,
( ~ sPE(a,greatest_lower_bound(a,least_upper_bound(a,a)))
| ~ sPE(greatest_lower_bound(a,least_upper_bound(a,a)),a)
| sPE(a,a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(greatest_lower_bound(a,least_upper_bound(a,a)),a),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',glb_absorbtion)]) ).
cnf(g6,plain,
( ~ sPE(greatest_lower_bound(a,least_upper_bound(a,a)),a)
| sPE(a,greatest_lower_bound(a,least_upper_bound(a,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),multiply(inverse(a),a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',lub_absorbtion)]) ).
cnf(g8,plain,
sPE(greatest_lower_bound(identity,inverse(a)),inverse(a)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p05b_2)]) ).
cnf(g9,plain,
sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(identity,a),multiply(inverse(a),a))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_glb2)]) ).
cnf(g10,plain,
( ~ sPE(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),multiply(inverse(a),a))
| sPE(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),multiply(inverse(a),a))
| ~ sPE(multiply(inverse(a),a),identity)
| sPE(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(greatest_lower_bound(identity,inverse(a)),inverse(a))
| ~ sPE(a,a)
| sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),multiply(inverse(a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),multiply(inverse(a),a))
| ~ sPE(multiply(inverse(a),a),identity)
| sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),identity)
| sPE(identity,multiply(greatest_lower_bound(identity,inverse(a)),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(identity,a),multiply(inverse(a),a)))
| ~ sPE(greatest_lower_bound(multiply(identity,a),multiply(inverse(a),a)),greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))))
| sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(multiply(identity,a),a)
| ~ sPE(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)))
| sPE(greatest_lower_bound(multiply(identity,a),multiply(inverse(a),a)),greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(identity,greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a))
| ~ sPE(greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a),a)
| sPE(identity,a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(identity,multiply(greatest_lower_bound(identity,inverse(a)),a))
| ~ sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a))
| sPE(identity,greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))))
| ~ sPE(greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))),greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a))
| sPE(multiply(greatest_lower_bound(identity,inverse(a)),a),greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
sPE(greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))),greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
cnf(g21,plain,
sPE(greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a),greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
cnf(g22,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a),greatest_lower_bound(a,identity))
| ~ sPE(greatest_lower_bound(a,identity),a)
| sPE(greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a),greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))))
| ~ sPE(greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))),greatest_lower_bound(a,identity))
| sPE(greatest_lower_bound(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),a),greatest_lower_bound(a,identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(a,a)
| ~ sPE(least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a)),identity)
| sPE(greatest_lower_bound(a,least_upper_bound(multiply(inverse(a),a),greatest_lower_bound(multiply(inverse(a),a),a))),greatest_lower_bound(a,identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(greatest_lower_bound(a,identity),greatest_lower_bound(identity,a))
| ~ sPE(greatest_lower_bound(identity,a),a)
| sPE(greatest_lower_bound(a,identity),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
sPE(greatest_lower_bound(a,identity),greatest_lower_bound(identity,a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP174-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 08:03:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 34.05/4.64 % symbols: 8
% 34.05/4.64 % clauses: 25
% 34.05/4.64 % start clauses: 1
% 34.05/4.64 % iterative deepening steps: 14165
% 34.05/4.64 % maximum path limit: 9
% 34.05/4.64 % literal attempts: 2093325
% 34.05/4.64 % depth failures: 539520
% 34.05/4.64 % regularity failures: 288255
% 34.05/4.64 % tautology failures: 193703
% 34.05/4.64 % reductions: 0
% 34.05/4.64 % extensions: 2079213
% 34.05/4.64 % SAT variables: 850955
% 34.05/4.64 % SAT clauses: 1364813
% 34.05/4.64 % WalkSAT solutions: 1364813
% 34.05/4.64 % CDCL solutions: 0
% 34.05/4.64 % SZS status Unsatisfiable for theBenchmark
% 34.05/4.64 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------