%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : GRP097-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:19:58 AM UTC 2026
% Result : Unsatisfiable 4.72s 2.89s
% Output : Refutation 5.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of formulae : 7 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 88 ( 8 ~; 6 |; 0 &; 74 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(multiply_decl,type,
multiply: $i > $i > $i ).
thf(inverse_decl,type,
inverse: $i > $i ).
thf(a1_decl,type,
a1: $i ).
thf(b1_decl,type,
b1: $i ).
thf(b2_decl,type,
b2: $i ).
thf(a2_decl,type,
a2: $i ).
thf(a3_decl,type,
a3: $i ).
thf(b3_decl,type,
b3: $i ).
thf(c3_decl,type,
c3: $i ).
thf(a4_decl,type,
a4: $i ).
thf(b4_decl,type,
b4: $i ).
thf(divide_decl,type,
divide: $i > $i > $i ).
thf(1,negated_conjecture,
( ( ( b4 @ ( a4 @ multiply ) )
!= ( a4 @ ( b4 @ multiply ) ) )
| ( ( c3 @ ( b3 @ ( a3 @ multiply ) @ multiply ) )
!= ( c3 @ ( b3 @ multiply ) @ ( a3 @ multiply ) ) )
| ( ( a2 @ ( b2 @ ( b2 @ inverse @ multiply ) @ multiply ) )
!= a2 )
| ( ( a1 @ ( a1 @ inverse @ multiply ) )
!= ( b1 @ ( b1 @ inverse @ multiply ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
thf(4,plain,
( ( ( b4 @ ( a4 @ multiply ) )
!= ( a4 @ ( b4 @ multiply ) ) )
| ( ( c3 @ ( b3 @ ( a3 @ multiply ) @ multiply ) )
!= ( c3 @ ( b3 @ multiply ) @ ( a3 @ multiply ) ) )
| ( ( a2 @ ( b2 @ ( b2 @ inverse @ multiply ) @ multiply ) )
!= a2 )
| ( ( a1 @ ( a1 @ inverse @ multiply ) )
!= ( b1 @ ( b1 @ inverse @ multiply ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ divide ) @ ( C @ ( B @ divide ) @ divide ) @ inverse @ ( A @ divide ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
thf(7,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ divide ) @ ( C @ ( B @ divide ) @ divide ) @ inverse @ ( A @ divide ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ multiply ) )
= ( B @ inverse @ ( A @ divide ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ multiply ) )
= ( B @ inverse @ ( A @ divide ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(21,plain,
$false,
inference(e,[status(thm)],[4,7,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP097-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.13/0.40 % Computer : n011.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Fri Sep 25 14:22:13 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 1.21/1.08 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.66/1.35 % [INFO] Parsing done (264ms).
% 1.66/1.37 % [INFO] Running in sequential loop mode.
% 2.55/1.99 % [INFO] eprover registered as external prover.
% 2.55/2.00 % [INFO] Scanning for conjecture ...
% 2.88/2.14 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 3.04/2.20 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 3.11/2.21 % [INFO] Problem is propositional (TPTP CNF).
% 3.11/2.22 % [INFO] Type checking passed.
% 3.11/2.22 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 4.72/2.88 % External prover 'e' found a proof!
% 4.72/2.88 % [INFO] Killing All external provers ...
% 4.72/2.88 % Time passed: 2285ms (effective reasoning time: 1508ms)
% 4.72/2.89 % Axioms used in derivation (2): single_axiom, multiply
% 4.72/2.89 % No. of inferences in proof: 7
% 4.72/2.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2285 ms resp. 1508 ms w/o parsing
% 5.21/2.94 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.21/2.94 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------