TSTP Solution File: GRP140-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n022.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:27 EDT 2022
% Result : Unsatisfiable 3.90s 0.89s
% Output : Proof 3.90s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(least_upper_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,b)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_glb1c)]) ).
cnf(g1,plain,
sPE(greatest_lower_bound(a,b),greatest_lower_bound(a,b)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(greatest_lower_bound(a,c),c)
| sPE(c,greatest_lower_bound(a,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(greatest_lower_bound(a,c),c),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_glb1c_1)]) ).
cnf(g5,plain,
sPE(greatest_lower_bound(b,c),c),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_glb1c_2)]) ).
cnf(g6,plain,
( ~ sPE(least_upper_bound(greatest_lower_bound(a,b),c),least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(greatest_lower_bound(a,b),c)))
| ~ sPE(least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(a,b))
| sPE(least_upper_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,b)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(greatest_lower_bound(a,b),c)),greatest_lower_bound(a,b)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',lub_absorbtion)]) ).
cnf(g8,plain,
( ~ sPE(greatest_lower_bound(a,b),greatest_lower_bound(a,b))
| ~ sPE(c,greatest_lower_bound(greatest_lower_bound(a,b),c))
| sPE(least_upper_bound(greatest_lower_bound(a,b),c),least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(greatest_lower_bound(a,b),c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,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(g10,plain,
( ~ sPE(a,a)
| ~ sPE(greatest_lower_bound(b,c),c)
| sPE(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(a,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(c,greatest_lower_bound(a,c))
| ~ sPE(greatest_lower_bound(a,c),greatest_lower_bound(greatest_lower_bound(a,b),c))
| sPE(c,greatest_lower_bound(greatest_lower_bound(a,b),c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(greatest_lower_bound(a,c),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(greatest_lower_bound(a,c),greatest_lower_bound(greatest_lower_bound(a,b),c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(a,c))
| sPE(greatest_lower_bound(a,c),greatest_lower_bound(a,greatest_lower_bound(b,c))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n022.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 10:11:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 3.90/0.89 % symbols: 10
% 3.90/0.89 % clauses: 25
% 3.90/0.89 % start clauses: 1
% 3.90/0.89 % iterative deepening steps: 3565
% 3.90/0.89 % maximum path limit: 7
% 3.90/0.89 % literal attempts: 369316
% 3.90/0.89 % depth failures: 130880
% 3.90/0.89 % regularity failures: 42652
% 3.90/0.89 % tautology failures: 25903
% 3.90/0.89 % reductions: 0
% 3.90/0.89 % extensions: 365804
% 3.90/0.89 % SAT variables: 131400
% 3.90/0.89 % SAT clauses: 204454
% 3.90/0.89 % WalkSAT solutions: 204454
% 3.90/0.89 % CDCL solutions: 0
% 3.90/0.89 % SZS status Unsatisfiable for theBenchmark
% 3.90/0.89 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------