TSTP Solution File: GRP563-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP563-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:56 EDT 2024
% Result : Unsatisfiable 0.43s 1.10s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% 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 : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_60,plain,
divide(divide(multiply(X0,X1),X2),divide(X0,X2)) = X1,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_99,plain,
divide(multiply(multiply(X0,X1),X2),divide(X0,inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_101,plain,
divide(divide(multiply(divide(multiply(X0,X1),X2),X3),divide(X0,X2)),X1) = X3,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_106,plain,
divide(multiply(multiply(X0,X1),X2),multiply(X0,X2)) = X1,
inference(superposition,[status(thm)],[c_50,c_99]) ).
cnf(c_131,plain,
multiply(divide(multiply(divide(multiply(X0,inverse(X1)),X2),X3),divide(X0,X2)),X1) = X3,
inference(superposition,[status(thm)],[c_101,c_50]) ).
cnf(c_193,plain,
divide(divide(X0,divide(divide(multiply(X1,inverse(X2)),X3),divide(X1,X3))),X0) = X2,
inference(superposition,[status(thm)],[c_131,c_101]) ).
cnf(c_347,plain,
divide(divide(X0,inverse(X1)),X0) = X1,
inference(superposition,[status(thm)],[c_60,c_193]) ).
cnf(c_373,plain,
divide(multiply(X0,X1),X0) = X1,
inference(light_normalisation,[status(thm)],[c_347,c_50]) ).
cnf(c_405,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_373,c_50]) ).
cnf(c_410,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_373,c_60]) ).
cnf(c_458,plain,
multiply(divide(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_410,c_373]) ).
cnf(c_476,plain,
divide(X0,multiply(inverse(X1),X0)) = X1,
inference(superposition,[status(thm)],[c_405,c_373]) ).
cnf(c_584,plain,
divide(multiply(multiply(divide(X0,X0),X1),X2),X2) = X1,
inference(superposition,[status(thm)],[c_458,c_106]) ).
cnf(c_599,plain,
divide(multiply(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_584,c_458]) ).
cnf(c_626,plain,
divide(multiply(divide(multiply(X0,inverse(X1)),X2),X3),divide(X0,X2)) = divide(X3,X1),
inference(superposition,[status(thm)],[c_131,c_599]) ).
cnf(c_629,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_405,c_599]) ).
cnf(c_636,plain,
divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_599,c_60]) ).
cnf(c_654,plain,
multiply(divide(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_131,c_626]) ).
cnf(c_730,plain,
divide(X0,multiply(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_50,c_636]) ).
cnf(c_911,plain,
divide(multiply(X0,X1),X2) = multiply(X1,divide(X0,X2)),
inference(superposition,[status(thm)],[c_60,c_654]) ).
cnf(c_914,plain,
multiply(multiply(X0,X1),X2) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_106,c_654]) ).
cnf(c_916,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_373,c_654]) ).
cnf(c_942,plain,
multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(a3,c3)),
inference(demodulation,[status(thm)],[c_51,c_914]) ).
cnf(c_978,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_476,c_730]) ).
cnf(c_985,plain,
divide(X0,inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_978,c_629]) ).
cnf(c_1013,plain,
divide(multiply(X0,X1),inverse(X2)) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_50,c_911]) ).
cnf(c_1745,plain,
multiply(X0,multiply(X1,X2)) = multiply(X2,multiply(X1,X0)),
inference(superposition,[status(thm)],[c_1013,c_985]) ).
cnf(c_5600,plain,
multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X2,X0)),
inference(superposition,[status(thm)],[c_916,c_1745]) ).
cnf(c_5697,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3)),
inference(demodulation,[status(thm)],[c_942,c_5600]) ).
cnf(c_5874,plain,
$false,
inference(superposition,[status(thm)],[c_916,c_5697]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP563-1 : TPTP v8.1.2. Released v2.6.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n026.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 : Fri May 3 00:09:06 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running UEQ theorem proving
% 0.17/0.44 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
% 0.43/1.10 % SZS status Started for theBenchmark.p
% 0.43/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.10
% 0.43/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.10
% 0.43/1.10 ------ iProver source info
% 0.43/1.10
% 0.43/1.10 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.10 git: non_committed_changes: false
% 0.43/1.10
% 0.43/1.10 ------ Parsing...successful
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.43/1.10
% 0.43/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.10
% 0.43/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.43/1.10 ------ Proving...
% 0.43/1.10 ------ Problem Properties
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 clauses 3
% 0.43/1.10 conjectures 1
% 0.43/1.10 EPR 0
% 0.43/1.10 Horn 3
% 0.43/1.10 unary 3
% 0.43/1.10 binary 0
% 0.43/1.10 lits 3
% 0.43/1.10 lits eq 3
% 0.43/1.10 fd_pure 0
% 0.43/1.10 fd_pseudo 0
% 0.43/1.10 fd_cond 0
% 0.43/1.10 fd_pseudo_cond 0
% 0.43/1.10 AC symbols 0
% 0.43/1.10
% 0.43/1.10 ------ Input Options Time Limit: Unbounded
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 ------
% 0.43/1.10 Current options:
% 0.43/1.10 ------
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 ------ Proving...
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.10
% 0.43/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.10
% 0.43/1.10
%------------------------------------------------------------------------------