%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRP166-4 : 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:34 EDT 2022
% Result : Unsatisfiable 13.44s 2.05s
% Output : Proof 13.44s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(greatest_lower_bound(a,multiply(b,a)),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat3b)]) ).
cnf(g1,plain,
( ~ sPE(greatest_lower_bound(a,multiply(b,a)),greatest_lower_bound(multiply(b,a),a))
| ~ sPE(greatest_lower_bound(multiply(b,a),a),a)
| sPE(greatest_lower_bound(a,multiply(b,a)),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(greatest_lower_bound(a,multiply(b,a)),greatest_lower_bound(multiply(b,a),a)),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',symmetry_of_glb)]) ).
cnf(g3,plain,
( ~ sPE(a,greatest_lower_bound(multiply(b,a),a))
| sPE(greatest_lower_bound(multiply(b,a),a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(multiply(identity,a),a),
inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).
cnf(g5,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(multiply(b,a),multiply(b,a)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(greatest_lower_bound(b,identity),identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat3b_2)]) ).
cnf(g8,plain,
( ~ sPE(multiply(identity,a),a)
| sPE(a,multiply(identity,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(a,multiply(greatest_lower_bound(b,identity),a))
| ~ sPE(multiply(greatest_lower_bound(b,identity),a),greatest_lower_bound(multiply(b,a),a))
| sPE(a,greatest_lower_bound(multiply(b,a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(multiply(greatest_lower_bound(b,identity),a),greatest_lower_bound(multiply(b,a),multiply(identity,a)))
| ~ sPE(greatest_lower_bound(multiply(b,a),multiply(identity,a)),greatest_lower_bound(multiply(b,a),a))
| sPE(multiply(greatest_lower_bound(b,identity),a),greatest_lower_bound(multiply(b,a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(greatest_lower_bound(multiply(b,a),a),greatest_lower_bound(multiply(b,a),multiply(identity,a)))
| sPE(greatest_lower_bound(multiply(b,a),multiply(identity,a)),greatest_lower_bound(multiply(b,a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(multiply(b,a),multiply(b,a))
| ~ sPE(a,multiply(identity,a))
| sPE(greatest_lower_bound(multiply(b,a),a),greatest_lower_bound(multiply(b,a),multiply(identity,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(multiply(greatest_lower_bound(b,identity),a),greatest_lower_bound(multiply(b,a),multiply(identity,a))),
inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_glb2)]) ).
cnf(g14,plain,
( ~ sPE(multiply(greatest_lower_bound(b,identity),a),a)
| sPE(a,multiply(greatest_lower_bound(b,identity),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(multiply(greatest_lower_bound(b,identity),a),multiply(identity,a))
| ~ sPE(multiply(identity,a),a)
| sPE(multiply(greatest_lower_bound(b,identity),a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(greatest_lower_bound(b,identity),identity)
| ~ sPE(a,a)
| sPE(multiply(greatest_lower_bound(b,identity),a),multiply(identity,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP166-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n022.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 04:06:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 13.44/2.05 % symbols: 9
% 13.44/2.05 % clauses: 25
% 13.44/2.05 % start clauses: 1
% 13.44/2.05 % iterative deepening steps: 7141
% 13.44/2.05 % maximum path limit: 8
% 13.44/2.05 % literal attempts: 868215
% 13.44/2.05 % depth failures: 231172
% 13.44/2.05 % regularity failures: 120307
% 13.44/2.05 % tautology failures: 64973
% 13.44/2.05 % reductions: 0
% 13.44/2.05 % extensions: 861086
% 13.44/2.05 % SAT variables: 329865
% 13.44/2.05 % SAT clauses: 530341
% 13.44/2.05 % WalkSAT solutions: 530338
% 13.44/2.05 % CDCL solutions: 0
% 13.44/2.05 % SZS status Unsatisfiable for theBenchmark
% 13.44/2.05 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------