TSTP Solution File: GRP509-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP509-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Fri May 3 02:22:47 EDT 2024
% Result : Unsatisfiable 3.83s 1.19s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 22 ( 21 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(multiply(multiply(X0,X1),X2),inverse(multiply(X0,X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_92,plain,
multiply(multiply(X0,X1),inverse(multiply(multiply(multiply(X2,X0),X3),X1))) = inverse(multiply(X2,X3)),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_93,plain,
multiply(X0,inverse(multiply(multiply(X1,X0),inverse(multiply(X1,X2))))) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_118,plain,
multiply(multiply(X0,inverse(multiply(X1,X2))),inverse(X0)) = inverse(multiply(X1,X2)),
inference(superposition,[status(thm)],[c_49,c_92]) ).
cnf(c_156,plain,
multiply(multiply(X0,inverse(X1)),inverse(X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_49,c_118]) ).
cnf(c_173,plain,
multiply(X0,inverse(multiply(multiply(X1,X0),X2))) = inverse(multiply(X1,X2)),
inference(superposition,[status(thm)],[c_49,c_156]) ).
cnf(c_187,plain,
inverse(multiply(X0,inverse(multiply(X0,X1)))) = X1,
inference(demodulation,[status(thm)],[c_93,c_173]) ).
cnf(c_204,plain,
multiply(multiply(multiply(X0,X1),inverse(multiply(X0,X2))),X2) = X1,
inference(superposition,[status(thm)],[c_187,c_49]) ).
cnf(c_206,plain,
multiply(multiply(X0,X1),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_187,c_156]) ).
cnf(c_220,plain,
multiply(X0,inverse(multiply(X1,X0))) = inverse(X1),
inference(superposition,[status(thm)],[c_206,c_206]) ).
cnf(c_224,plain,
multiply(X0,inverse(multiply(X1,inverse(X1)))) = X0,
inference(superposition,[status(thm)],[c_206,c_49]) ).
cnf(c_253,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_220,c_187]) ).
cnf(c_275,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_253,c_206]) ).
cnf(c_295,plain,
multiply(multiply(X0,inverse(X0)),X1) = X1,
inference(superposition,[status(thm)],[c_224,c_206]) ).
cnf(c_309,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_220,c_204]) ).
cnf(c_443,plain,
multiply(multiply(multiply(multiply(X0,inverse(X0)),X1),inverse(X2)),X2) = X1,
inference(superposition,[status(thm)],[c_295,c_204]) ).
cnf(c_452,plain,
multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(light_normalisation,[status(thm)],[c_443,c_295]) ).
cnf(c_472,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_309,c_275]) ).
cnf(c_480,plain,
multiply(inverse(b1),b1) != multiply(a1,inverse(a1)),
inference(demodulation,[status(thm)],[c_50,c_472]) ).
cnf(c_592,plain,
multiply(inverse(X0),X0) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_295,c_452]) ).
cnf(c_829,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_480,c_592]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP509-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:56:27 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.83/1.19 % SZS status Started for theBenchmark.p
% 3.83/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.83/1.19
% 3.83/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.83/1.19
% 3.83/1.19 ------ iProver source info
% 3.83/1.19
% 3.83/1.19 git: date: 2024-05-02 19:28:25 +0000
% 3.83/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.83/1.19 git: non_committed_changes: false
% 3.83/1.19
% 3.83/1.19 ------ Parsing...successful
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.83/1.19
% 3.83/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.83/1.19
% 3.83/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.83/1.19 ------ Proving...
% 3.83/1.19 ------ Problem Properties
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19 clauses 2
% 3.83/1.19 conjectures 1
% 3.83/1.19 EPR 0
% 3.83/1.19 Horn 2
% 3.83/1.19 unary 2
% 3.83/1.19 binary 0
% 3.83/1.19 lits 2
% 3.83/1.19 lits eq 2
% 3.83/1.19 fd_pure 0
% 3.83/1.19 fd_pseudo 0
% 3.83/1.19 fd_cond 0
% 3.83/1.19 fd_pseudo_cond 0
% 3.83/1.19 AC symbols 0
% 3.83/1.19
% 3.83/1.19 ------ Input Options Time Limit: Unbounded
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19 ------
% 3.83/1.19 Current options:
% 3.83/1.19 ------
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19 ------ Proving...
% 3.83/1.19
% 3.83/1.19
% 3.83/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.83/1.19
% 3.83/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.83/1.20
% 3.83/1.20
%------------------------------------------------------------------------------