%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : BOO001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n023.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 : Thu Jul 14 23:48:40 EDT 2022
% Result : Unsatisfiable 222.63s 28.32s
% Output : Proof 222.63s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(inverse(inverse(a)),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_is_self_cancelling)]) ).
cnf(g1,plain,
( ~ sPE(a,inverse(inverse(a)))
| sPE(inverse(inverse(a)),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(multiply(a,a,a),a),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',ternary_multiply_1)]) ).
cnf(g3,plain,
( ~ sPE(multiply(a,a,a),a)
| sPE(a,multiply(a,a,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(multiply(inverse(inverse(a)),a,inverse(a)),inverse(inverse(a))),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',right_inverse)]) ).
cnf(g5,plain,
( ~ sPE(a,multiply(inverse(inverse(a)),a,inverse(a)))
| ~ sPE(multiply(inverse(inverse(a)),a,inverse(a)),inverse(inverse(a)))
| sPE(a,inverse(inverse(a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(a,multiply(a,a,a))
| ~ sPE(multiply(a,a,a),a)
| sPE(a,a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(inverse(inverse(a)),inverse(inverse(a))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),inverse(inverse(a))),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',ternary_multiply_2)]) ).
cnf(g9,plain,
sPE(multiply(inverse(a),inverse(a),a),inverse(a)),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',ternary_multiply_2)]) ).
cnf(g10,plain,
sPE(inverse(a),inverse(a)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(multiply(inverse(a),inverse(a),a),inverse(a))
| sPE(inverse(a),multiply(inverse(a),inverse(a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(multiply(inverse(inverse(a)),inverse(a),a),a),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',left_inverse)]) ).
cnf(g13,plain,
( ~ sPE(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),inverse(inverse(a)))
| ~ sPE(a,a)
| ~ sPE(inverse(a),inverse(a))
| sPE(multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a)),multiply(inverse(inverse(a)),a,inverse(a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(a,multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a)))
| ~ sPE(multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a)),multiply(inverse(inverse(a)),a,inverse(a)))
| sPE(a,multiply(inverse(inverse(a)),a,inverse(a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a)),a)
| sPE(a,multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a)),multiply(inverse(inverse(a)),a,inverse(a)))
| ~ sPE(multiply(inverse(inverse(a)),a,inverse(a)),a)
| sPE(multiply(multiply(inverse(inverse(a)),inverse(inverse(a)),inverse(inverse(a))),a,inverse(a)),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(inverse(inverse(a)),inverse(inverse(a)))
| ~ sPE(a,a)
| ~ sPE(inverse(a),multiply(inverse(a),inverse(a),a))
| sPE(multiply(inverse(inverse(a)),a,inverse(a)),multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(multiply(inverse(inverse(a)),inverse(a),a),a)
| sPE(a,multiply(inverse(inverse(a)),inverse(a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(multiply(inverse(inverse(a)),a,inverse(a)),multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a)))
| ~ sPE(multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a)),a)
| sPE(multiply(inverse(inverse(a)),a,inverse(a)),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(a,multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a)))
| sPE(multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a)),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
sPE(multiply(inverse(inverse(a)),a,a),a),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',ternary_multiply_1)]) ).
cnf(g22,plain,
( ~ sPE(a,multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a)))
| ~ sPE(multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a)),multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a)))
| sPE(a,multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
sPE(multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a)),multiply(inverse(inverse(a)),a,multiply(inverse(a),inverse(a),a))),
inference(ground_cnf,[],[file('Axioms/BOO001-0.ax',associativity)]) ).
cnf(g24,plain,
( ~ sPE(a,multiply(inverse(inverse(a)),inverse(a),a))
| ~ sPE(multiply(inverse(inverse(a)),inverse(a),a),multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a)))
| sPE(a,multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a)),multiply(inverse(inverse(a)),inverse(a),a))
| sPE(multiply(inverse(inverse(a)),inverse(a),a),multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(multiply(inverse(inverse(a)),a,inverse(a)),inverse(inverse(a)))
| ~ sPE(inverse(a),inverse(a))
| ~ sPE(multiply(inverse(inverse(a)),a,a),a)
| sPE(multiply(multiply(inverse(inverse(a)),a,inverse(a)),inverse(a),multiply(inverse(inverse(a)),a,a)),multiply(inverse(inverse(a)),inverse(a),a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n023.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 : Wed Jun 1 20:28:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 222.63/28.32 % symbols: 5
% 222.63/28.32 % clauses: 11
% 222.63/28.32 % start clauses: 1
% 222.63/28.32 % iterative deepening steps: 11855
% 222.63/28.32 % maximum path limit: 13
% 222.63/28.32 % literal attempts: 4149988
% 222.63/28.32 % depth failures: 920964
% 222.63/28.32 % regularity failures: 595425
% 222.63/28.32 % tautology failures: 300744
% 222.63/28.32 % reductions: 0
% 222.63/28.32 % extensions: 4139951
% 222.63/28.32 % SAT variables: 2395535
% 222.63/28.32 % SAT clauses: 3539514
% 222.63/28.32 % WalkSAT solutions: 3539512
% 222.63/28.32 % CDCL solutions: 0
% 222.63/28.32 % SZS status Unsatisfiable for theBenchmark
% 222.63/28.32 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------