TSTP Solution File: GRP407-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP407-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:30 EDT 2024
% Result : Unsatisfiable 48.09s 6.73s
% Output : CNFRefutation 48.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 4 RR)
% Number of literals : 33 ( 32 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 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 : 92 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(X1),multiply(inverse(X1),X1))))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_92,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2)))) = multiply(X0,inverse(multiply(inverse(X3),multiply(inverse(X1),multiply(inverse(X1),X1))))),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_120,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X2),multiply(inverse(X1),multiply(inverse(X1),X1)))))) = X2,
inference(superposition,[status(thm)],[c_92,c_49]) ).
cnf(c_131,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(multiply(X0,X1)),X3))),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X3,
inference(superposition,[status(thm)],[c_92,c_49]) ).
cnf(c_208,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,X2))),multiply(inverse(X1),multiply(inverse(X1),X1)))) = X2,
inference(superposition,[status(thm)],[c_131,c_131]) ).
cnf(c_247,plain,
multiply(inverse(multiply(X0,X1)),inverse(multiply(X2,multiply(inverse(multiply(X0,X2)),multiply(inverse(multiply(X0,X2)),multiply(X0,X2)))))) = multiply(inverse(X1),multiply(inverse(X1),X1)),
inference(superposition,[status(thm)],[c_208,c_49]) ).
cnf(c_258,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,X2)) = multiply(inverse(multiply(X3,X1)),multiply(X3,X2)),
inference(superposition,[status(thm)],[c_208,c_120]) ).
cnf(c_302,plain,
multiply(inverse(multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))),multiply(X0,X2)) = multiply(X3,multiply(inverse(multiply(inverse(multiply(X4,X1)),multiply(X4,X3))),X2)),
inference(superposition,[status(thm)],[c_208,c_258]) ).
cnf(c_352,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,multiply(inverse(X1),X1)))))) = multiply(inverse(X1),X3),
inference(superposition,[status(thm)],[c_258,c_120]) ).
cnf(c_429,plain,
inverse(multiply(inverse(multiply(inverse(X0),X1)),multiply(inverse(X0),multiply(inverse(X0),X0)))) = inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,multiply(inverse(X0),X0)))),
inference(superposition,[status(thm)],[c_352,c_208]) ).
cnf(c_1235,plain,
multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(X2)))),multiply(inverse(X1),multiply(inverse(X1),X1))) = X2,
inference(superposition,[status(thm)],[c_247,c_120]) ).
cnf(c_2824,plain,
inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,multiply(inverse(X2),X2)))) = inverse(multiply(inverse(multiply(X3,X1)),multiply(X3,multiply(inverse(X2),X2)))),
inference(superposition,[status(thm)],[c_429,c_429]) ).
cnf(c_4289,plain,
multiply(inverse(multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))),multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_1235,c_302]) ).
cnf(c_5048,plain,
multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_4289,c_4289]) ).
cnf(c_5343,plain,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(X1),multiply(inverse(X3),X3))))) = X2,
inference(superposition,[status(thm)],[c_5048,c_49]) ).
cnf(c_5344,plain,
multiply(multiply(inverse(X0),X0),a2) != a2,
inference(superposition,[status(thm)],[c_5048,c_50]) ).
cnf(c_5376,plain,
inverse(multiply(inverse(multiply(inverse(X0),X0)),multiply(inverse(X1),multiply(inverse(X1),X1)))) = X1,
inference(superposition,[status(thm)],[c_5048,c_208]) ).
cnf(c_5979,plain,
inverse(multiply(inverse(multiply(inverse(X0),X0)),multiply(inverse(X1),multiply(inverse(X2),X2)))) = X1,
inference(superposition,[status(thm)],[c_5048,c_5376]) ).
cnf(c_6051,plain,
inverse(multiply(inverse(X0),X0)) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_5048,c_5979]) ).
cnf(c_6153,plain,
inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,multiply(inverse(X2),X2)))) = X1,
inference(superposition,[status(thm)],[c_5979,c_2824]) ).
cnf(c_6156,plain,
inverse(multiply(multiply(inverse(X0),X0),multiply(inverse(X1),multiply(inverse(X2),X2)))) = X1,
inference(superposition,[status(thm)],[c_5979,c_5979]) ).
cnf(c_6277,plain,
multiply(multiply(inverse(X0),X0),multiply(inverse(X1),X1)) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_6051,c_5048]) ).
cnf(c_14462,plain,
inverse(multiply(inverse(multiply(multiply(inverse(X0),X0),X1)),multiply(inverse(X2),X2))) = X1,
inference(superposition,[status(thm)],[c_6277,c_6153]) ).
cnf(c_41987,plain,
multiply(inverse(X0),multiply(inverse(X1),X1)) = inverse(multiply(X0,multiply(inverse(X2),X2))),
inference(superposition,[status(thm)],[c_6156,c_14462]) ).
cnf(c_49847,plain,
inverse(multiply(multiply(inverse(X0),X0),inverse(multiply(X1,multiply(inverse(X2),X2))))) = X1,
inference(superposition,[status(thm)],[c_41987,c_6156]) ).
cnf(c_50097,plain,
multiply(inverse(inverse(multiply(multiply(inverse(X0),X0),X1))),multiply(inverse(X2),X2)) = X1,
inference(superposition,[status(thm)],[c_41987,c_14462]) ).
cnf(c_51546,plain,
inverse(multiply(inverse(multiply(multiply(inverse(X0),X0),multiply(inverse(X1),X1))),X2)) = inverse(X2),
inference(superposition,[status(thm)],[c_5343,c_49847]) ).
cnf(c_54481,plain,
multiply(inverse(inverse(multiply(inverse(multiply(multiply(inverse(X0),X0),multiply(inverse(X1),X1))),X2))),multiply(inverse(X3),X3)) = X2,
inference(superposition,[status(thm)],[c_41987,c_50097]) ).
cnf(c_54733,plain,
multiply(inverse(inverse(X0)),multiply(inverse(X1),X1)) = X0,
inference(light_normalisation,[status(thm)],[c_54481,c_51546]) ).
cnf(c_54738,plain,
multiply(multiply(inverse(X0),X0),X1) = X1,
inference(demodulation,[status(thm)],[c_50097,c_54733]) ).
cnf(c_54746,plain,
a2 != a2,
inference(demodulation,[status(thm)],[c_5344,c_54738]) ).
cnf(c_54751,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_54746]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP407-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n031.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 : Fri May 3 00:23:16 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
% 48.09/6.73 % SZS status Started for theBenchmark.p
% 48.09/6.73 % SZS status Unsatisfiable for theBenchmark.p
% 48.09/6.73
% 48.09/6.73 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 48.09/6.73
% 48.09/6.73 ------ iProver source info
% 48.09/6.73
% 48.09/6.73 git: date: 2024-05-02 19:28:25 +0000
% 48.09/6.73 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 48.09/6.73 git: non_committed_changes: false
% 48.09/6.73
% 48.09/6.73 ------ Parsing...successful
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 48.09/6.73
% 48.09/6.73 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 48.09/6.73
% 48.09/6.73 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 48.09/6.73 ------ Proving...
% 48.09/6.73 ------ Problem Properties
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73 clauses 2
% 48.09/6.73 conjectures 1
% 48.09/6.73 EPR 0
% 48.09/6.73 Horn 2
% 48.09/6.73 unary 2
% 48.09/6.73 binary 0
% 48.09/6.73 lits 2
% 48.09/6.73 lits eq 2
% 48.09/6.73 fd_pure 0
% 48.09/6.73 fd_pseudo 0
% 48.09/6.73 fd_cond 0
% 48.09/6.73 fd_pseudo_cond 0
% 48.09/6.73 AC symbols 0
% 48.09/6.73
% 48.09/6.73 ------ Input Options Time Limit: Unbounded
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73 ------
% 48.09/6.73 Current options:
% 48.09/6.73 ------
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73 ------ Proving...
% 48.09/6.73
% 48.09/6.73
% 48.09/6.73 % SZS status Unsatisfiable for theBenchmark.p
% 48.09/6.73
% 48.09/6.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 48.09/6.73
% 48.09/6.73
%------------------------------------------------------------------------------