TSTP Solution File: ALG002-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:03:10 EDT 2024
% Result : Unsatisfiable 3.50s 1.20s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
product(X0,multiplicative_identity,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).
cnf(c_50,plain,
~ product(multiplicative_identity,multiplicative_identity,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_abelian) ).
cnf(c_51,plain,
( ~ product(X0,X1,X2)
| product(additive_inverse(X0),additive_inverse(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_of_inverses1) ).
cnf(c_52,plain,
( ~ product(additive_inverse(X0),additive_inverse(X1),X2)
| product(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_of_inverses2) ).
cnf(c_53,plain,
( ~ product(X0,X1,X2)
| product(X0,additive_inverse(X1),additive_inverse(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_to_inverse) ).
cnf(c_54,plain,
( product(X0,multiplicative_inverse(X0),multiplicative_identity)
| product(X0,X0,additive_identity) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_and_identity) ).
cnf(c_55,plain,
( ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_greater_than_0) ).
cnf(c_56,plain,
( ~ product(X0,X0,additive_identity)
| ~ greater_than_0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greater_than_0_square) ).
cnf(c_57,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_product) ).
cnf(c_58,plain,
( product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(X0))
| greater_than_0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_and_inverse) ).
cnf(c_59,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X0,additive_identity)
| product(X2,X2,additive_identity) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',square_to_0) ).
cnf(c_60,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(X0)
| ~ greater_than_0(X1)
| greater_than_0(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_and_greater_than_0) ).
cnf(c_61,plain,
greater_than_0(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_greater_than_0) ).
cnf(c_62,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_inverse_greater_than_0) ).
cnf(c_173,plain,
multiplicative_inverse(a) = sP0_iProver_def,
definition ).
cnf(c_174,negated_conjecture,
~ greater_than_0(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_62,c_173]) ).
cnf(c_489,plain,
( product(a,a,additive_identity)
| product(a,sP0_iProver_def,multiplicative_identity) ),
inference(superposition,[status(thm)],[c_173,c_54]) ).
cnf(c_506,plain,
product(multiplicative_identity,X0,X0),
inference(superposition,[status(thm)],[c_49,c_57]) ).
cnf(c_517,plain,
( ~ product(X0,X1,X2)
| product(additive_inverse(X1),additive_inverse(X0),X2) ),
inference(superposition,[status(thm)],[c_51,c_57]) ).
cnf(c_539,plain,
( ~ product(additive_inverse(X0),X1,X2)
| product(X0,X1,additive_inverse(X2)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_557,plain,
( ~ greater_than_0(a)
| product(a,sP0_iProver_def,multiplicative_identity) ),
inference(superposition,[status(thm)],[c_489,c_56]) ).
cnf(c_558,plain,
product(a,sP0_iProver_def,multiplicative_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_557,c_61]) ).
cnf(c_559,plain,
product(sP0_iProver_def,a,multiplicative_identity),
inference(superposition,[status(thm)],[c_558,c_57]) ).
cnf(c_653,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0)
| greater_than_0(additive_inverse(X2)) ),
inference(superposition,[status(thm)],[c_53,c_60]) ).
cnf(c_660,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(additive_inverse(X1))
| greater_than_0(X2) ),
inference(superposition,[status(thm)],[c_517,c_60]) ).
cnf(c_693,plain,
( ~ product(sP0_iProver_def,sP0_iProver_def,additive_identity)
| product(multiplicative_identity,multiplicative_identity,additive_identity) ),
inference(superposition,[status(thm)],[c_559,c_59]) ).
cnf(c_694,plain,
~ product(sP0_iProver_def,sP0_iProver_def,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_693,c_50]) ).
cnf(c_729,plain,
( greater_than_0(additive_inverse(sP0_iProver_def))
| greater_than_0(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_58,c_694]) ).
cnf(c_730,plain,
greater_than_0(additive_inverse(sP0_iProver_def)),
inference(forward_subsumption_resolution,[status(thm)],[c_729,c_174]) ).
cnf(c_765,plain,
( ~ product(X0,X1,X2)
| product(X1,additive_inverse(X0),additive_inverse(X2)) ),
inference(superposition,[status(thm)],[c_517,c_539]) ).
cnf(c_1109,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(X1)
| greater_than_0(additive_inverse(X2)) ),
inference(superposition,[status(thm)],[c_765,c_60]) ).
cnf(c_3391,plain,
( ~ greater_than_0(additive_inverse(sP0_iProver_def))
| ~ greater_than_0(a)
| greater_than_0(additive_inverse(multiplicative_identity)) ),
inference(superposition,[status(thm)],[c_558,c_653]) ).
cnf(c_3425,plain,
greater_than_0(additive_inverse(multiplicative_identity)),
inference(forward_subsumption_resolution,[status(thm)],[c_3391,c_61,c_730]) ).
cnf(c_3615,plain,
( ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(additive_inverse(multiplicative_identity))
| greater_than_0(X0) ),
inference(superposition,[status(thm)],[c_506,c_660]) ).
cnf(c_3685,plain,
~ greater_than_0(additive_inverse(X0)),
inference(global_subsumption_just,[status(thm)],[c_1109,c_55,c_3425,c_3615]) ).
cnf(c_3688,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_730,c_3685]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n008.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 : Thu May 2 22:48:57 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.50/1.20 % SZS status Started for theBenchmark.p
% 3.50/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.20
% 3.50/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.50/1.20
% 3.50/1.20 ------ iProver source info
% 3.50/1.20
% 3.50/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.50/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.50/1.20 git: non_committed_changes: false
% 3.50/1.20
% 3.50/1.20 ------ Parsing...successful
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.50/1.20
% 3.50/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.50/1.20
% 3.50/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.50/1.20 ------ Proving...
% 3.50/1.20 ------ Problem Properties
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20 clauses 15
% 3.50/1.20 conjectures 1
% 3.50/1.20 EPR 8
% 3.50/1.20 Horn 13
% 3.50/1.20 unary 5
% 3.50/1.20 binary 7
% 3.50/1.20 lits 29
% 3.50/1.20 lits eq 1
% 3.50/1.20 fd_pure 0
% 3.50/1.20 fd_pseudo 0
% 3.50/1.20 fd_cond 0
% 3.50/1.20 fd_pseudo_cond 0
% 3.50/1.20 AC symbols 0
% 3.50/1.20
% 3.50/1.20 ------ Schedule dynamic 5 is on
% 3.50/1.20
% 3.50/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20 ------
% 3.50/1.20 Current options:
% 3.50/1.20 ------
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20 ------ Proving...
% 3.50/1.20
% 3.50/1.20
% 3.50/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.20
% 3.50/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.20
% 3.50/1.20
%------------------------------------------------------------------------------