TSTP Solution File: GRP159-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n029.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:31 EDT 2022
% Result : Unsatisfiable 7.74s 1.39s
% Output : Proof 7.74s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(least_upper_bound(multiply(c,a),multiply(c,b)),multiply(c,b)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono2c)]) ).
cnf(g1,plain,
sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c)),multiply(c,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',lub_absorbtion)]) ).
cnf(g2,plain,
( ~ sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c)),multiply(c,b))
| sPE(multiply(c,b),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(c,c),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(greatest_lower_bound(a,b),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono2c_1)]) ).
cnf(g5,plain,
sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),multiply(c,a))),multiply(c,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',lub_absorbtion)]) ).
cnf(g6,plain,
( ~ sPE(least_upper_bound(multiply(c,a),multiply(c,b)),least_upper_bound(multiply(c,greatest_lower_bound(b,a)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c))))
| ~ sPE(least_upper_bound(multiply(c,greatest_lower_bound(b,a)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c))),multiply(c,b))
| sPE(least_upper_bound(multiply(c,a),multiply(c,b)),multiply(c,b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(least_upper_bound(multiply(c,greatest_lower_bound(b,a)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c))),least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b)))
| ~ sPE(least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b)),multiply(c,b))
| sPE(least_upper_bound(multiply(c,greatest_lower_bound(b,a)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c))),multiply(c,b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),multiply(c,a))))
| ~ sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),multiply(c,a))),multiply(c,b))
| sPE(least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b)),multiply(c,b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),multiply(c,a))),least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b)))
| sPE(least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),multiply(c,a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),multiply(c,a))),least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_lub)]) ).
cnf(g11,plain,
( ~ sPE(multiply(c,greatest_lower_bound(b,a)),greatest_lower_bound(multiply(c,b),multiply(c,a)))
| ~ sPE(least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c)),multiply(c,b))
| sPE(least_upper_bound(multiply(c,greatest_lower_bound(b,a)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c))),least_upper_bound(greatest_lower_bound(multiply(c,b),multiply(c,a)),multiply(c,b))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(multiply(c,greatest_lower_bound(b,a)),greatest_lower_bound(multiply(c,b),multiply(c,a))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_glb1)]) ).
cnf(g13,plain,
( ~ sPE(multiply(c,a),multiply(c,greatest_lower_bound(b,a)))
| ~ sPE(multiply(c,b),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c)))
| sPE(least_upper_bound(multiply(c,a),multiply(c,b)),least_upper_bound(multiply(c,greatest_lower_bound(b,a)),least_upper_bound(multiply(c,b),greatest_lower_bound(multiply(c,b),c)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(c,c)
| ~ sPE(a,greatest_lower_bound(b,a))
| sPE(multiply(c,a),multiply(c,greatest_lower_bound(b,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(greatest_lower_bound(b,a),a)
| sPE(a,greatest_lower_bound(b,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(greatest_lower_bound(b,a),greatest_lower_bound(a,b))
| ~ sPE(greatest_lower_bound(a,b),a)
| sPE(greatest_lower_bound(b,a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
sPE(greatest_lower_bound(b,a),greatest_lower_bound(a,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n029.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 22:23:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 7.74/1.39 % symbols: 10
% 7.74/1.39 % clauses: 24
% 7.74/1.39 % start clauses: 1
% 7.74/1.39 % iterative deepening steps: 6044
% 7.74/1.39 % maximum path limit: 6
% 7.74/1.39 % literal attempts: 775903
% 7.74/1.39 % depth failures: 282745
% 7.74/1.39 % regularity failures: 88745
% 7.74/1.39 % tautology failures: 59158
% 7.74/1.39 % reductions: 0
% 7.74/1.39 % extensions: 769889
% 7.74/1.39 % SAT variables: 241599
% 7.74/1.39 % SAT clauses: 376263
% 7.74/1.39 % WalkSAT solutions: 376262
% 7.74/1.39 % CDCL solutions: 0
% 7.74/1.39 % SZS status Unsatisfiable for theBenchmark
% 7.74/1.39 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------