TSTP Solution File: GRP519-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP519-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:49 EDT 2024
% Result : Unsatisfiable 3.32s 1.16s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,multiply(multiply(inverse(multiply(X0,X1)),X2),X1)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_60,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_61,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_62,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_63,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_64,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_50,c_62,c_63,c_60,c_61]) ).
cnf(c_107,plain,
multiply(a3,multiply(multiply(inverse(sP3_iProver_def),X0),sP2_iProver_def)) = X0,
inference(superposition,[status(thm)],[c_63,c_49]) ).
cnf(c_108,plain,
multiply(X0,multiply(multiply(inverse(X1),X2),multiply(multiply(inverse(multiply(X0,X3)),X1),X3))) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_288,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_49,c_108]) ).
cnf(c_438,plain,
multiply(multiply(inverse(multiply(inverse(X0),X1)),X2),X1) = multiply(X2,X0),
inference(superposition,[status(thm)],[c_49,c_288]) ).
cnf(c_472,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_438,c_49]) ).
cnf(c_533,plain,
multiply(inverse(b3),sP0_iProver_def) = a3,
inference(superposition,[status(thm)],[c_60,c_472]) ).
cnf(c_534,plain,
multiply(inverse(c3),sP2_iProver_def) = b3,
inference(superposition,[status(thm)],[c_62,c_472]) ).
cnf(c_544,plain,
multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_472,c_49]) ).
cnf(c_551,plain,
multiply(a3,multiply(X0,sP2_iProver_def)) = multiply(X0,sP3_iProver_def),
inference(superposition,[status(thm)],[c_472,c_107]) ).
cnf(c_612,plain,
multiply(inverse(sP0_iProver_def),a3) = inverse(b3),
inference(superposition,[status(thm)],[c_533,c_472]) ).
cnf(c_616,plain,
multiply(inverse(sP2_iProver_def),b3) = inverse(c3),
inference(superposition,[status(thm)],[c_534,c_472]) ).
cnf(c_649,plain,
multiply(inverse(a3),inverse(b3)) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_612,c_472]) ).
cnf(c_665,plain,
multiply(inverse(b3),inverse(c3)) = inverse(sP2_iProver_def),
inference(superposition,[status(thm)],[c_616,c_472]) ).
cnf(c_766,plain,
multiply(X0,multiply(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_544,c_472]) ).
cnf(c_889,plain,
multiply(X0,multiply(inverse(multiply(X0,multiply(inverse(X1),X1))),X2)) = X2,
inference(superposition,[status(thm)],[c_766,c_49]) ).
cnf(c_898,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(light_normalisation,[status(thm)],[c_889,c_766]) ).
cnf(c_941,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_472,c_898]) ).
cnf(c_948,plain,
multiply(a3,inverse(sP0_iProver_def)) = inverse(b3),
inference(superposition,[status(thm)],[c_649,c_898]) ).
cnf(c_961,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_898,c_472]) ).
cnf(c_1003,plain,
multiply(X0,multiply(X1,inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_961,c_472]) ).
cnf(c_1125,plain,
multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X2,X0)),
inference(superposition,[status(thm)],[c_941,c_544]) ).
cnf(c_1203,plain,
multiply(c3,inverse(sP2_iProver_def)) = inverse(b3),
inference(superposition,[status(thm)],[c_665,c_1003]) ).
cnf(c_1246,plain,
multiply(sP2_iProver_def,inverse(b3)) = c3,
inference(superposition,[status(thm)],[c_1203,c_1003]) ).
cnf(c_1689,plain,
multiply(sP2_iProver_def,multiply(a3,X0)) = multiply(X0,sP3_iProver_def),
inference(demodulation,[status(thm)],[c_551,c_1125]) ).
cnf(c_1698,plain,
multiply(inverse(sP0_iProver_def),sP3_iProver_def) = multiply(sP2_iProver_def,inverse(b3)),
inference(superposition,[status(thm)],[c_948,c_1689]) ).
cnf(c_1711,plain,
multiply(inverse(sP0_iProver_def),sP3_iProver_def) = c3,
inference(light_normalisation,[status(thm)],[c_1698,c_1246]) ).
cnf(c_1740,plain,
multiply(sP3_iProver_def,inverse(sP0_iProver_def)) = c3,
inference(demodulation,[status(thm)],[c_1711,c_941]) ).
cnf(c_1744,plain,
multiply(sP0_iProver_def,c3) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_1740,c_1003]) ).
cnf(c_1745,plain,
sP1_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_1744,c_61]) ).
cnf(c_1746,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1745,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP519-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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:41:44 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running UEQ theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.32/1.16 % SZS status Started for theBenchmark.p
% 3.32/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.32/1.16
% 3.32/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.32/1.16
% 3.32/1.16 ------ iProver source info
% 3.32/1.16
% 3.32/1.16 git: date: 2024-05-02 19:28:25 +0000
% 3.32/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.32/1.16 git: non_committed_changes: false
% 3.32/1.16
% 3.32/1.16 ------ Parsing...successful
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.32/1.16
% 3.32/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.32/1.16
% 3.32/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.32/1.16 ------ Proving...
% 3.32/1.16 ------ Problem Properties
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16 clauses 6
% 3.32/1.16 conjectures 1
% 3.32/1.16 EPR 1
% 3.32/1.16 Horn 6
% 3.32/1.16 unary 6
% 3.32/1.16 binary 0
% 3.32/1.16 lits 6
% 3.32/1.16 lits eq 6
% 3.32/1.16 fd_pure 0
% 3.32/1.16 fd_pseudo 0
% 3.32/1.16 fd_cond 0
% 3.32/1.16 fd_pseudo_cond 0
% 3.32/1.16 AC symbols 0
% 3.32/1.16
% 3.32/1.16 ------ Input Options Time Limit: Unbounded
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16 ------
% 3.32/1.16 Current options:
% 3.32/1.16 ------
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16 ------ Proving...
% 3.32/1.16
% 3.32/1.16
% 3.32/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.32/1.16
% 3.32/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.32/1.16
% 3.32/1.16
%------------------------------------------------------------------------------