TSTP Solution File: GRP173-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n020.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 198.77s 25.34s
% Output : Proof 198.77s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(identity,a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p05a)]) ).
cnf(g1,plain,
( ~ sPE(a,identity)
| sPE(identity,a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(multiply(identity,a),a),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).
cnf(g3,plain,
( ~ sPE(a,least_upper_bound(a,greatest_lower_bound(a,a)))
| ~ sPE(least_upper_bound(a,greatest_lower_bound(a,a)),a)
| sPE(a,a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(least_upper_bound(a,greatest_lower_bound(a,a)),a),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',lub_absorbtion)]) ).
cnf(g5,plain,
sPE(multiply(inverse(a),a),identity),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_inverse)]) ).
cnf(g6,plain,
sPE(least_upper_bound(identity,a),identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',p05a_1)]) ).
cnf(g7,plain,
sPE(least_upper_bound(identity,a),least_upper_bound(a,identity)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_lub)]) ).
cnf(g8,plain,
sPE(greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a)),multiply(inverse(a),a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',glb_absorbtion)]) ).
cnf(g9,plain,
( ~ sPE(least_upper_bound(a,greatest_lower_bound(a,a)),a)
| sPE(a,least_upper_bound(a,greatest_lower_bound(a,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(least_upper_bound(identity,inverse(a)),identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',p05a_2)]) ).
cnf(g11,plain,
sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),least_upper_bound(identity,a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',glb_absorbtion)]) ).
cnf(g12,plain,
( ~ sPE(greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a)),multiply(inverse(a),a))
| ~ sPE(multiply(inverse(a),a),identity)
| sPE(greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a)),identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),least_upper_bound(identity,a))
| ~ sPE(least_upper_bound(identity,a),identity)
| sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),identity)
| sPE(identity,greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),least_upper_bound(identity,a))
| ~ sPE(least_upper_bound(identity,a),least_upper_bound(a,identity))
| sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),least_upper_bound(a,identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a)),identity)
| sPE(identity,greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(identity,greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a)))
| ~ sPE(greatest_lower_bound(multiply(inverse(a),a),least_upper_bound(multiply(inverse(a),a),a)),multiply(inverse(a),a))
| sPE(identity,multiply(inverse(a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(identity,greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)))
| ~ sPE(greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(least_upper_bound(identity,a),a)),least_upper_bound(a,identity))
| sPE(identity,least_upper_bound(a,identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(a,multiply(least_upper_bound(identity,inverse(a)),a))
| ~ sPE(multiply(least_upper_bound(identity,inverse(a)),a),identity)
| sPE(a,identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(identity,multiply(least_upper_bound(identity,inverse(a)),a))
| sPE(multiply(least_upper_bound(identity,inverse(a)),a),identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
sPE(multiply(least_upper_bound(identity,inverse(a)),a),least_upper_bound(multiply(identity,a),multiply(inverse(a),a))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub2)]) ).
cnf(g22,plain,
( ~ sPE(identity,least_upper_bound(multiply(identity,a),multiply(inverse(a),a)))
| ~ sPE(least_upper_bound(multiply(identity,a),multiply(inverse(a),a)),multiply(least_upper_bound(identity,inverse(a)),a))
| sPE(identity,multiply(least_upper_bound(identity,inverse(a)),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(identity,least_upper_bound(a,identity))
| ~ sPE(least_upper_bound(a,identity),least_upper_bound(multiply(identity,a),multiply(inverse(a),a)))
| sPE(identity,least_upper_bound(multiply(identity,a),multiply(inverse(a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(a,multiply(identity,a))
| ~ sPE(identity,multiply(inverse(a),a))
| sPE(least_upper_bound(a,identity),least_upper_bound(multiply(identity,a),multiply(inverse(a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(multiply(least_upper_bound(identity,inverse(a)),a),least_upper_bound(multiply(identity,a),multiply(inverse(a),a)))
| sPE(least_upper_bound(multiply(identity,a),multiply(inverse(a),a)),multiply(least_upper_bound(identity,inverse(a)),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(a,least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)))
| ~ sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),multiply(least_upper_bound(identity,inverse(a)),a))
| sPE(a,multiply(least_upper_bound(identity,inverse(a)),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),multiply(least_upper_bound(identity,inverse(a)),a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',lub_absorbtion)]) ).
cnf(g28,plain,
( ~ sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),a)
| sPE(a,least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),multiply(identity,a))
| ~ sPE(multiply(identity,a),a)
| sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g30,plain,
( ~ sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),multiply(least_upper_bound(identity,inverse(a)),a))
| ~ sPE(multiply(least_upper_bound(identity,inverse(a)),a),multiply(identity,a))
| sPE(least_upper_bound(multiply(least_upper_bound(identity,inverse(a)),a),greatest_lower_bound(multiply(least_upper_bound(identity,inverse(a)),a),a)),multiply(identity,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ sPE(least_upper_bound(identity,inverse(a)),identity)
| ~ sPE(a,a)
| sPE(multiply(least_upper_bound(identity,inverse(a)),a),multiply(identity,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g32,plain,
( ~ sPE(multiply(identity,a),a)
| sPE(a,multiply(identity,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n020.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 : Mon Jun 13 19:18:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 198.77/25.34 % symbols: 8
% 198.77/25.34 % clauses: 25
% 198.77/25.34 % start clauses: 1
% 198.77/25.34 % iterative deepening steps: 31766
% 198.77/25.34 % maximum path limit: 10
% 198.77/25.34 % literal attempts: 7182562
% 198.77/25.34 % depth failures: 1820399
% 198.77/25.34 % regularity failures: 975357
% 198.77/25.34 % tautology failures: 641237
% 198.77/25.34 % reductions: 0
% 198.77/25.34 % extensions: 7150867
% 198.77/25.34 % SAT variables: 3361371
% 198.77/25.34 % SAT clauses: 5359094
% 198.77/25.34 % WalkSAT solutions: 5359083
% 198.77/25.34 % CDCL solutions: 8
% 198.77/25.34 % SZS status Unsatisfiable for theBenchmark
% 198.77/25.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------