TSTP Solution File: FLD071-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : FLD071-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 : Wed Aug 30 22:33:25 EDT 2023
% Result : Unsatisfiable 2.58s 1.19s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 10 unt; 2 nHn; 27 RR)
% Number of literals : 59 ( 0 equ; 31 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_51,plain,
defined(u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined) ).
cnf(c_52,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_53,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(c_54,negated_conjecture,
equalish(multiply(a,b),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_u_6) ).
cnf(c_55,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).
cnf(c_66,plain,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(c_71,plain,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(c_73,plain,
( ~ defined(X0)
| ~ defined(X1)
| less_or_equal(X0,X1)
| less_or_equal(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(c_75,plain,
( ~ less_or_equal(additive_identity,X0)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).
cnf(c_77,plain,
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(c_78,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(c_81,plain,
( ~ less_or_equal(X0,X1)
| ~ equalish(X0,X2)
| less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(c_266,plain,
( ~ less_or_equal(X0,u)
| ~ equalish(X0,additive_identity)
| less_or_equal(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_81]) ).
cnf(c_267,plain,
( ~ defined(X0)
| ~ defined(u)
| less_or_equal(X0,u)
| less_or_equal(u,X0) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_289,plain,
( ~ defined(u)
| less_or_equal(u,u) ),
inference(instantiation,[status(thm)],[c_267]) ).
cnf(c_290,plain,
( ~ less_or_equal(u,u)
| ~ equalish(u,additive_identity)
| less_or_equal(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_266]) ).
cnf(c_350,plain,
( ~ equalish(additive_identity,u)
| equalish(u,additive_identity) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_501,plain,
( ~ equalish(X0,u)
| ~ equalish(additive_identity,X0)
| equalish(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_582,plain,
equalish(u,multiply(a,b)),
inference(superposition,[status(thm)],[c_54,c_77]) ).
cnf(c_1349,plain,
( ~ equalish(multiply(a,b),u)
| ~ equalish(additive_identity,multiply(a,b))
| equalish(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_501]) ).
cnf(c_1963,plain,
( ~ defined(u)
| ~ defined(additive_identity)
| less_or_equal(u,additive_identity) ),
inference(superposition,[status(thm)],[c_73,c_55]) ).
cnf(c_1975,plain,
less_or_equal(u,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_1963,c_66,c_51]) ).
cnf(c_2162,plain,
( ~ equalish(u,X0)
| less_or_equal(X0,additive_identity) ),
inference(superposition,[status(thm)],[c_1975,c_81]) ).
cnf(c_3590,plain,
( ~ less_or_equal(multiply(a,b),additive_identity)
| ~ less_or_equal(additive_identity,multiply(a,b))
| equalish(additive_identity,multiply(a,b)) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_4356,plain,
less_or_equal(multiply(a,b),additive_identity),
inference(superposition,[status(thm)],[c_582,c_2162]) ).
cnf(c_9209,plain,
( ~ less_or_equal(additive_identity,a)
| ~ less_or_equal(additive_identity,b)
| less_or_equal(additive_identity,multiply(a,b)) ),
inference(instantiation,[status(thm)],[c_75]) ).
cnf(c_9210,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9209,c_4356,c_3590,c_1349,c_350,c_290,c_289,c_54,c_55,c_52,c_53,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD071-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n006.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 : Mon Aug 28 00:42:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.58/1.19 % SZS status Started for theBenchmark.p
% 2.58/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.58/1.19
% 2.58/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.58/1.19
% 2.58/1.19 ------ iProver source info
% 2.58/1.19
% 2.58/1.19 git: date: 2023-05-31 18:12:56 +0000
% 2.58/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.58/1.19 git: non_committed_changes: false
% 2.58/1.19 git: last_make_outside_of_git: false
% 2.58/1.19
% 2.58/1.19 ------ Parsing...successful
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.58/1.19
% 2.58/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.58/1.19 ------ Proving...
% 2.58/1.19 ------ Problem Properties
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19 clauses 34
% 2.58/1.19 conjectures 4
% 2.58/1.19 EPR 16
% 2.58/1.19 Horn 31
% 2.58/1.19 unary 10
% 2.58/1.19 binary 6
% 2.58/1.19 lits 80
% 2.58/1.19 lits eq 0
% 2.58/1.19 fd_pure 0
% 2.58/1.19 fd_pseudo 0
% 2.58/1.19 fd_cond 0
% 2.58/1.19 fd_pseudo_cond 0
% 2.58/1.19 AC symbols 0
% 2.58/1.19
% 2.58/1.19 ------ Schedule dynamic 5 is on
% 2.58/1.19
% 2.58/1.19 ------ no equalities: superposition off
% 2.58/1.19
% 2.58/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19 ------
% 2.58/1.19 Current options:
% 2.58/1.19 ------
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19 ------ Proving...
% 2.58/1.19
% 2.58/1.19
% 2.58/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.58/1.19
% 2.58/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.58/1.19
% 2.58/1.19
%------------------------------------------------------------------------------