TSTP Solution File: GRP402-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP402-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:29 EDT 2024
% Result : Unsatisfiable 10.16s 2.18s
% Output : CNFRefutation 10.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,multiply(X1,commutator(X1,X0))) = multiply(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutator) ).
cnf(c_50,plain,
multiply(commutator(X0,X1),X2) = multiply(X2,commutator(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nilpotency) ).
cnf(c_51,negated_conjecture,
commutator(commutator(a,b),c) != commutator(a,commutator(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutator_is_associative) ).
cnf(c_52,plain,
( multiply(X0,X1) != multiply(X2,X1)
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP008-1.ax',right_cancellation) ).
cnf(c_53,plain,
( multiply(X0,X1) != multiply(X0,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP008-1.ax',left_cancellation) ).
cnf(c_54,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP008-0.ax',associativity_of_multiply) ).
cnf(c_85,plain,
commutator(a,b) = sP0_iProver_def,
definition ).
cnf(c_86,plain,
commutator(sP0_iProver_def,c) = sP1_iProver_def,
definition ).
cnf(c_87,plain,
commutator(b,c) = sP2_iProver_def,
definition ).
cnf(c_88,plain,
commutator(a,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_89,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_51,c_87,c_88,c_85,c_86]) ).
cnf(c_90,plain,
X0 = X0,
theory(equality) ).
cnf(c_91,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_92,plain,
( X0 != X1
| X2 != X3
| multiply(X0,X2) = multiply(X1,X3) ),
theory(equality) ).
cnf(c_96,plain,
a = a,
inference(instantiation,[status(thm)],[c_90]) ).
cnf(c_143,plain,
multiply(c,multiply(sP0_iProver_def,sP1_iProver_def)) = multiply(sP0_iProver_def,c),
inference(superposition,[status(thm)],[c_86,c_49]) ).
cnf(c_149,plain,
multiply(X0,sP0_iProver_def) = multiply(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_85,c_50]) ).
cnf(c_150,plain,
multiply(X0,sP2_iProver_def) = multiply(sP2_iProver_def,X0),
inference(superposition,[status(thm)],[c_87,c_50]) ).
cnf(c_151,plain,
multiply(X0,sP1_iProver_def) = multiply(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_86,c_50]) ).
cnf(c_152,plain,
multiply(X0,sP3_iProver_def) = multiply(sP3_iProver_def,X0),
inference(superposition,[status(thm)],[c_88,c_50]) ).
cnf(c_157,plain,
multiply(a,sP2_iProver_def) = multiply(sP2_iProver_def,a),
inference(instantiation,[status(thm)],[c_150]) ).
cnf(c_208,plain,
( sP1_iProver_def != X0
| sP3_iProver_def != X0
| sP1_iProver_def = sP3_iProver_def ),
inference(instantiation,[status(thm)],[c_91]) ).
cnf(c_230,plain,
( multiply(c,X0) != multiply(sP0_iProver_def,c)
| multiply(sP0_iProver_def,sP1_iProver_def) = X0 ),
inference(superposition,[status(thm)],[c_143,c_53]) ).
cnf(c_253,plain,
multiply(multiply(sP0_iProver_def,X0),X1) = multiply(X0,multiply(sP0_iProver_def,X1)),
inference(superposition,[status(thm)],[c_149,c_54]) ).
cnf(c_261,plain,
( multiply(X0,sP0_iProver_def) != multiply(sP0_iProver_def,X1)
| X0 = X1 ),
inference(superposition,[status(thm)],[c_149,c_53]) ).
cnf(c_277,plain,
( sP1_iProver_def != sP1_iProver_def
| sP3_iProver_def != sP1_iProver_def
| sP1_iProver_def = sP3_iProver_def ),
inference(instantiation,[status(thm)],[c_208]) ).
cnf(c_278,plain,
sP1_iProver_def = sP1_iProver_def,
inference(instantiation,[status(thm)],[c_90]) ).
cnf(c_283,plain,
multiply(multiply(sP2_iProver_def,X0),X1) = multiply(X0,multiply(sP2_iProver_def,X1)),
inference(superposition,[status(thm)],[c_150,c_54]) ).
cnf(c_285,plain,
( multiply(X0,X1) != multiply(sP2_iProver_def,X0)
| X1 = sP2_iProver_def ),
inference(superposition,[status(thm)],[c_150,c_53]) ).
cnf(c_309,plain,
( multiply(sP3_iProver_def,X0) != multiply(sP1_iProver_def,X0)
| sP3_iProver_def = sP1_iProver_def ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_310,plain,
( multiply(sP3_iProver_def,a) != multiply(sP1_iProver_def,a)
| sP3_iProver_def = sP1_iProver_def ),
inference(instantiation,[status(thm)],[c_309]) ).
cnf(c_316,plain,
multiply(multiply(sP1_iProver_def,X0),X1) = multiply(X0,multiply(sP1_iProver_def,X1)),
inference(superposition,[status(thm)],[c_151,c_54]) ).
cnf(c_319,plain,
multiply(X0,multiply(X1,sP1_iProver_def)) = multiply(sP1_iProver_def,multiply(X0,X1)),
inference(superposition,[status(thm)],[c_151,c_54]) ).
cnf(c_462,plain,
multiply(X0,multiply(sP0_iProver_def,X1)) = multiply(sP0_iProver_def,multiply(X0,X1)),
inference(demodulation,[status(thm)],[c_253,c_54]) ).
cnf(c_476,plain,
multiply(X0,multiply(sP0_iProver_def,sP1_iProver_def)) = multiply(sP0_iProver_def,multiply(sP1_iProver_def,X0)),
inference(superposition,[status(thm)],[c_151,c_462]) ).
cnf(c_755,plain,
( multiply(sP1_iProver_def,X0) != X1
| multiply(sP3_iProver_def,X0) != X1
| multiply(sP3_iProver_def,X0) = multiply(sP1_iProver_def,X0) ),
inference(instantiation,[status(thm)],[c_91]) ).
cnf(c_756,plain,
( multiply(sP1_iProver_def,a) != a
| multiply(sP3_iProver_def,a) != a
| multiply(sP3_iProver_def,a) = multiply(sP1_iProver_def,a) ),
inference(instantiation,[status(thm)],[c_755]) ).
cnf(c_794,plain,
multiply(X0,multiply(sP2_iProver_def,X1)) = multiply(sP2_iProver_def,multiply(X0,X1)),
inference(demodulation,[status(thm)],[c_283,c_54]) ).
cnf(c_820,plain,
multiply(X0,multiply(sP2_iProver_def,sP3_iProver_def)) = multiply(sP2_iProver_def,multiply(sP3_iProver_def,X0)),
inference(superposition,[status(thm)],[c_152,c_794]) ).
cnf(c_846,plain,
multiply(X0,multiply(sP2_iProver_def,commutator(X0,sP2_iProver_def))) = multiply(X0,sP2_iProver_def),
inference(superposition,[status(thm)],[c_794,c_49]) ).
cnf(c_1002,plain,
( multiply(X0,sP1_iProver_def) != X1
| X2 != X2
| multiply(X2,multiply(X0,sP1_iProver_def)) = multiply(X2,X1) ),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_1003,plain,
( multiply(a,sP1_iProver_def) != a
| a != a
| multiply(a,multiply(a,sP1_iProver_def)) = multiply(a,a) ),
inference(instantiation,[status(thm)],[c_1002]) ).
cnf(c_1326,plain,
multiply(X0,multiply(sP1_iProver_def,X1)) = multiply(sP1_iProver_def,multiply(X0,X1)),
inference(demodulation,[status(thm)],[c_316,c_54]) ).
cnf(c_1587,plain,
multiply(X0,multiply(X1,sP1_iProver_def)) = multiply(X0,multiply(sP1_iProver_def,X1)),
inference(superposition,[status(thm)],[c_319,c_1326]) ).
cnf(c_6824,plain,
( multiply(X0,multiply(X1,sP1_iProver_def)) != multiply(X0,X2)
| multiply(sP1_iProver_def,X1) = X2 ),
inference(superposition,[status(thm)],[c_1587,c_53]) ).
cnf(c_6873,plain,
( multiply(a,multiply(a,sP1_iProver_def)) != multiply(a,a)
| multiply(sP1_iProver_def,a) = a ),
inference(instantiation,[status(thm)],[c_6824]) ).
cnf(c_8878,plain,
( multiply(sP0_iProver_def,multiply(sP1_iProver_def,X0)) != multiply(X1,sP0_iProver_def)
| multiply(X0,sP1_iProver_def) = X1 ),
inference(superposition,[status(thm)],[c_1587,c_261]) ).
cnf(c_8973,plain,
( multiply(sP0_iProver_def,multiply(sP1_iProver_def,a)) != multiply(a,sP0_iProver_def)
| multiply(a,sP1_iProver_def) = a ),
inference(instantiation,[status(thm)],[c_8878]) ).
cnf(c_9044,plain,
( multiply(X0,sP2_iProver_def) != multiply(sP2_iProver_def,X0)
| multiply(sP2_iProver_def,commutator(X0,sP2_iProver_def)) = sP2_iProver_def ),
inference(superposition,[status(thm)],[c_846,c_285]) ).
cnf(c_9103,plain,
multiply(sP2_iProver_def,commutator(X0,sP2_iProver_def)) = sP2_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_9044,c_150]) ).
cnf(c_10317,plain,
multiply(sP2_iProver_def,sP3_iProver_def) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_88,c_9103]) ).
cnf(c_10341,plain,
multiply(sP2_iProver_def,multiply(sP3_iProver_def,X0)) = multiply(X0,sP2_iProver_def),
inference(demodulation,[status(thm)],[c_820,c_10317]) ).
cnf(c_10582,plain,
( multiply(X0,sP2_iProver_def) != multiply(sP2_iProver_def,X1)
| multiply(sP3_iProver_def,X0) = X1 ),
inference(superposition,[status(thm)],[c_10341,c_53]) ).
cnf(c_10656,plain,
( multiply(a,sP2_iProver_def) != multiply(sP2_iProver_def,a)
| multiply(sP3_iProver_def,a) = a ),
inference(instantiation,[status(thm)],[c_10582]) ).
cnf(c_18418,plain,
multiply(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_149,c_230]) ).
cnf(c_18507,plain,
multiply(sP0_iProver_def,multiply(sP1_iProver_def,X0)) = multiply(X0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_476,c_18418]) ).
cnf(c_18514,plain,
multiply(sP0_iProver_def,multiply(sP1_iProver_def,a)) = multiply(a,sP0_iProver_def),
inference(instantiation,[status(thm)],[c_18507]) ).
cnf(c_18515,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_18514,c_10656,c_8973,c_6873,c_1003,c_756,c_310,c_278,c_277,c_157,c_89,c_96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP402-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 00:05:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.16/2.18 % SZS status Started for theBenchmark.p
% 10.16/2.18 % SZS status Unsatisfiable for theBenchmark.p
% 10.16/2.18
% 10.16/2.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.16/2.18
% 10.16/2.18 ------ iProver source info
% 10.16/2.18
% 10.16/2.18 git: date: 2024-05-02 19:28:25 +0000
% 10.16/2.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.16/2.18 git: non_committed_changes: false
% 10.16/2.18
% 10.16/2.18 ------ Parsing...successful
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 10.16/2.18
% 10.16/2.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.16/2.18
% 10.16/2.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 10.16/2.18 ------ Proving...
% 10.16/2.18 ------ Problem Properties
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18 clauses 10
% 10.16/2.18 conjectures 1
% 10.16/2.18 EPR 1
% 10.16/2.18 Horn 10
% 10.16/2.18 unary 8
% 10.16/2.18 binary 2
% 10.16/2.18 lits 12
% 10.16/2.18 lits eq 12
% 10.16/2.18 fd_pure 0
% 10.16/2.18 fd_pseudo 0
% 10.16/2.18 fd_cond 0
% 10.16/2.18 fd_pseudo_cond 2
% 10.16/2.18 AC symbols 0
% 10.16/2.18
% 10.16/2.18 ------ Schedule dynamic 5 is on
% 10.16/2.18
% 10.16/2.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18 ------
% 10.16/2.18 Current options:
% 10.16/2.18 ------
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18 ------ Proving...
% 10.16/2.18
% 10.16/2.18
% 10.16/2.18 % SZS status Unsatisfiable for theBenchmark.p
% 10.16/2.18
% 10.16/2.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.16/2.18
% 10.16/2.18
%------------------------------------------------------------------------------