TSTP Solution File: GRP516-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP516-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Mon Jun 24 07:00:41 EDT 2024
% Result : Unsatisfiable 2.73s 1.17s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 2 RR)
% Number of literals : 16 ( 15 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X0,X2)))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(c_91,plain,
multiply(X0,multiply(X1,inverse(multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X3,X2))))))) = X3,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_95,plain,
multiply(X0,multiply(X1,inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_49,c_91]) ).
cnf(c_114,plain,
multiply(X0,multiply(X1,inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_95,c_91]) ).
cnf(c_129,plain,
multiply(X0,multiply(multiply(X1,multiply(X2,inverse(X0))),inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_114,c_49]) ).
cnf(c_131,plain,
multiply(multiply(X0,X1),multiply(X2,inverse(multiply(X2,X1)))) = X0,
inference(superposition,[status(thm)],[c_114,c_91]) ).
cnf(c_162,plain,
multiply(multiply(X0,X1),multiply(X2,inverse(X0))) = multiply(X2,X1),
inference(superposition,[status(thm)],[c_131,c_91]) ).
cnf(c_274,plain,
multiply(X0,multiply(multiply(X1,X2),inverse(X1))) = multiply(X0,X2),
inference(superposition,[status(thm)],[c_162,c_129]) ).
cnf(c_332,plain,
multiply(multiply(X0,X1),X2) = multiply(multiply(X0,X2),X1),
inference(superposition,[status(thm)],[c_274,c_162]) ).
cnf(c_405,plain,
multiply(X0,multiply(multiply(X1,inverse(X0)),X2)) = multiply(X1,X2),
inference(superposition,[status(thm)],[c_332,c_114]) ).
cnf(c_454,plain,
multiply(X0,inverse(multiply(X0,inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_405,c_95]) ).
cnf(c_486,plain,
multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_454,c_114]) ).
cnf(c_532,plain,
multiply(multiply(X0,X1),inverse(X1)) = X0,
inference(demodulation,[status(thm)],[c_486,c_332]) ).
cnf(c_547,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_532,c_114]) ).
cnf(c_554,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_547]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP516-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n023.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Jun 20 08:32:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running UEQ theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.73/1.17 % SZS status Started for theBenchmark.p
% 2.73/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.73/1.17
% 2.73/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.73/1.17
% 2.73/1.17 ------ iProver source info
% 2.73/1.17
% 2.73/1.17 git: date: 2024-06-12 09:56:46 +0000
% 2.73/1.17 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.73/1.17 git: non_committed_changes: false
% 2.73/1.17
% 2.73/1.17 ------ Parsing...successful
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.73/1.17
% 2.73/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.73/1.17
% 2.73/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.73/1.17 ------ Proving...
% 2.73/1.17 ------ Problem Properties
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 clauses 2
% 2.73/1.17 conjectures 1
% 2.73/1.17 EPR 0
% 2.73/1.17 Horn 2
% 2.73/1.17 unary 2
% 2.73/1.17 binary 0
% 2.73/1.17 lits 2
% 2.73/1.17 lits eq 2
% 2.73/1.17 fd_pure 0
% 2.73/1.17 fd_pseudo 0
% 2.73/1.17 fd_cond 0
% 2.73/1.17 fd_pseudo_cond 0
% 2.73/1.17 AC symbols 0
% 2.73/1.17
% 2.73/1.17 ------ Input Options Time Limit: Unbounded
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 ------
% 2.73/1.17 Current options:
% 2.73/1.17 ------
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 ------ Proving...
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.73/1.17
% 2.73/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.73/1.17
% 2.73/1.17
%------------------------------------------------------------------------------