TSTP Solution File: GRP163-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP163-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n010.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:32 EDT 2022
% Result : Unsatisfiable 17.63s 2.75s
% Output : Proof 17.63s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(greatest_lower_bound(a,c),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_transb)]) ).
cnf(g1,plain,
( ~ sPE(a,greatest_lower_bound(a,c))
| sPE(greatest_lower_bound(a,c),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(greatest_lower_bound(a,b),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_transb_1)]) ).
cnf(g3,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(c,c),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(greatest_lower_bound(b,c),b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_transb_2)]) ).
cnf(g6,plain,
sPE(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(greatest_lower_bound(a,b),c)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',associativity_of_glb)]) ).
cnf(g7,plain,
( ~ sPE(a,greatest_lower_bound(greatest_lower_bound(b,c),a))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(b,c),a),greatest_lower_bound(a,greatest_lower_bound(b,c)))
| sPE(a,greatest_lower_bound(a,greatest_lower_bound(b,c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(greatest_lower_bound(greatest_lower_bound(b,c),a),greatest_lower_bound(a,greatest_lower_bound(b,c))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
cnf(g9,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(b,c),a),a)
| sPE(a,greatest_lower_bound(greatest_lower_bound(b,c),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(greatest_lower_bound(greatest_lower_bound(b,c),a),greatest_lower_bound(b,a))
| ~ sPE(greatest_lower_bound(b,a),a)
| sPE(greatest_lower_bound(greatest_lower_bound(b,c),a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(greatest_lower_bound(b,c),b)
| ~ sPE(a,a)
| sPE(greatest_lower_bound(greatest_lower_bound(b,c),a),greatest_lower_bound(b,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,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(g13,plain,
sPE(greatest_lower_bound(b,a),greatest_lower_bound(a,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
cnf(g14,plain,
( ~ sPE(a,greatest_lower_bound(greatest_lower_bound(a,b),c))
| ~ sPE(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,c))
| sPE(a,greatest_lower_bound(a,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(greatest_lower_bound(a,b),a)
| ~ sPE(c,c)
| sPE(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(a,greatest_lower_bound(a,greatest_lower_bound(b,c)))
| ~ sPE(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(greatest_lower_bound(a,b),c))
| sPE(a,greatest_lower_bound(greatest_lower_bound(a,b),c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP163-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : satcop --statistics %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 10:03:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 17.63/2.75 % symbols: 10
% 17.63/2.75 % clauses: 25
% 17.63/2.75 % start clauses: 1
% 17.63/2.75 % iterative deepening steps: 8797
% 17.63/2.75 % maximum path limit: 8
% 17.63/2.75 % literal attempts: 1255975
% 17.63/2.75 % depth failures: 328533
% 17.63/2.75 % regularity failures: 174792
% 17.63/2.75 % tautology failures: 102842
% 17.63/2.75 % reductions: 0
% 17.63/2.75 % extensions: 1247211
% 17.63/2.75 % SAT variables: 487954
% 17.63/2.75 % SAT clauses: 790321
% 17.63/2.75 % WalkSAT solutions: 790315
% 17.63/2.75 % CDCL solutions: 0
% 17.63/2.75 % SZS status Unsatisfiable for theBenchmark
% 17.63/2.75 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------