TSTP Solution File: MSC012+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 : Thu Aug 31 09:26:11 EDT 2023
% Result : Theorem 1.74s 1.16s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 13 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 154 ( 72 ~; 71 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 0 sgn; 29 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( p(X1)
& less(X0,X1)
& p(X0) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_to_right) ).
fof(f2,axiom,
! [X0] :
( ? [X1] :
( p(X1)
& less(X0,X1) )
| p(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_to_left) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_less) ).
fof(f4,axiom,
! [X0] :
? [X1] : less(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',serial_less) ).
fof(f5,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f6,negated_conjecture,
~ goal,
inference(negated_conjecture,[],[f5]) ).
fof(f7,plain,
~ goal,
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f9,plain,
! [X0,X1] :
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( p(X1)
& less(X0,X1) )
=> ( p(sK0(X0))
& less(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0] :
( ( p(sK0(X0))
& less(X0,sK0(X0)) )
| p(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f2,f12]) ).
fof(f14,plain,
! [X0] :
( ? [X1] : less(X0,X1)
=> less(X0,sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] : less(X0,sK1(X0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f4,f14]) ).
fof(f16,plain,
! [X0,X1] :
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X0] :
( less(X0,sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
! [X0] :
( p(sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0] : less(X0,sK1(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
~ goal,
inference(cnf_transformation,[],[f7]) ).
cnf(c_49,plain,
( ~ less(X0,X1)
| ~ p(X0)
| ~ p(X1)
| goal ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,plain,
( p(sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_51,plain,
( less(X0,sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_52,plain,
( ~ less(X0,X1)
| ~ less(X2,X0)
| less(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_53,plain,
less(X0,sK1(X0)),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,negated_conjecture,
~ goal,
inference(cnf_transformation,[],[f21]) ).
cnf(c_55,plain,
less(iProver_bot,sK1(iProver_bot)),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_56,plain,
( p(sK0(iProver_bot))
| p(iProver_bot) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_59,plain,
( ~ p(X1)
| ~ p(X0)
| ~ less(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_54,c_49]) ).
cnf(c_60,plain,
( ~ less(X0,X1)
| ~ p(X0)
| ~ p(X1) ),
inference(renaming,[status(thm)],[c_59]) ).
cnf(c_108,plain,
( ~ less(X0,sK1(X0))
| ~ p(sK1(X0))
| ~ p(X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_109,plain,
( ~ less(iProver_bot,sK1(iProver_bot))
| ~ p(sK1(iProver_bot))
| ~ p(iProver_bot) ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_111,plain,
( less(sK1(X0),sK0(sK1(X0)))
| p(sK1(X0)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_112,plain,
( p(sK0(sK1(X0)))
| p(sK1(X0)) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_113,plain,
( p(sK0(sK1(iProver_bot)))
| p(sK1(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_114,plain,
( less(sK1(iProver_bot),sK0(sK1(iProver_bot)))
| p(sK1(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_117,plain,
( ~ less(sK1(X0),sK0(sK1(X0)))
| ~ less(X1,sK1(X0))
| less(X1,sK0(sK1(X0))) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_120,plain,
( ~ less(sK1(iProver_bot),sK0(sK1(iProver_bot)))
| ~ less(iProver_bot,sK1(iProver_bot))
| less(iProver_bot,sK0(sK1(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_117]) ).
cnf(c_125,plain,
( ~ less(X0,sK0(X0))
| ~ less(X1,X0)
| less(X1,sK0(X0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_128,plain,
( ~ less(sK0(X0),sK1(sK0(X0)))
| ~ p(sK1(sK0(X0)))
| ~ p(sK0(X0)) ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_129,plain,
( ~ less(sK0(iProver_bot),sK1(sK0(iProver_bot)))
| ~ p(sK1(sK0(iProver_bot)))
| ~ p(sK0(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_128]) ).
cnf(c_146,plain,
( p(sK0(sK1(sK0(X0))))
| p(sK1(sK0(X0))) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_147,plain,
( p(sK0(sK1(sK0(iProver_bot))))
| p(sK1(sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_187,plain,
( less(sK1(sK0(X0)),sK0(sK1(sK0(X0))))
| p(sK1(sK0(X0))) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_188,plain,
( less(sK1(sK0(iProver_bot)),sK0(sK1(sK0(iProver_bot))))
| p(sK1(sK0(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_187]) ).
cnf(c_192,plain,
( ~ less(X0,sK0(X1))
| ~ p(sK0(X1))
| ~ p(X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_231,plain,
( ~ less(sK0(X0),sK0(X1))
| ~ p(sK0(X0))
| ~ p(sK0(X1)) ),
inference(instantiation,[status(thm)],[c_192]) ).
cnf(c_252,plain,
less(sK0(X0),sK1(sK0(X0))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_253,plain,
less(sK0(iProver_bot),sK1(sK0(iProver_bot))),
inference(instantiation,[status(thm)],[c_252]) ).
cnf(c_273,plain,
( ~ less(sK0(X0),X1)
| ~ less(X1,sK0(X1))
| less(sK0(X0),sK0(X1)) ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_469,plain,
( ~ less(X0,sK0(sK1(X1)))
| ~ p(sK0(sK1(X1)))
| ~ p(X0) ),
inference(instantiation,[status(thm)],[c_192]) ).
cnf(c_470,plain,
( ~ less(iProver_bot,sK0(sK1(iProver_bot)))
| ~ p(sK0(sK1(iProver_bot)))
| ~ p(iProver_bot) ),
inference(instantiation,[status(thm)],[c_469]) ).
cnf(c_519,plain,
( ~ less(sK1(sK0(X0)),sK0(sK1(sK0(X0))))
| ~ less(sK0(X0),sK1(sK0(X0)))
| less(sK0(X0),sK0(sK1(sK0(X0)))) ),
inference(instantiation,[status(thm)],[c_273]) ).
cnf(c_520,plain,
( ~ less(sK1(sK0(iProver_bot)),sK0(sK1(sK0(iProver_bot))))
| ~ less(sK0(iProver_bot),sK1(sK0(iProver_bot)))
| less(sK0(iProver_bot),sK0(sK1(sK0(iProver_bot)))) ),
inference(instantiation,[status(thm)],[c_519]) ).
cnf(c_892,plain,
( ~ less(sK0(X0),sK0(sK1(sK0(X0))))
| ~ p(sK0(sK1(sK0(X0))))
| ~ p(sK0(X0)) ),
inference(instantiation,[status(thm)],[c_231]) ).
cnf(c_895,plain,
( ~ less(sK0(iProver_bot),sK0(sK1(sK0(iProver_bot))))
| ~ p(sK0(sK1(sK0(iProver_bot))))
| ~ p(sK0(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_892]) ).
cnf(c_896,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_895,c_520,c_470,c_253,c_188,c_147,c_129,c_120,c_114,c_113,c_109,c_56,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 13:48:17 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.74/1.16 % SZS status Started for theBenchmark.p
% 1.74/1.16 % SZS status Theorem for theBenchmark.p
% 1.74/1.16
% 1.74/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.74/1.16
% 1.74/1.16 ------ iProver source info
% 1.74/1.16
% 1.74/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.74/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.74/1.16 git: non_committed_changes: false
% 1.74/1.16 git: last_make_outside_of_git: false
% 1.74/1.16
% 1.74/1.16 ------ Parsing...
% 1.74/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.74/1.16
% 1.74/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.74/1.16
% 1.74/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.74/1.16 ------ Proving...
% 1.74/1.16 ------ Problem Properties
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 clauses 5
% 1.74/1.16 conjectures 0
% 1.74/1.16 EPR 2
% 1.74/1.16 Horn 3
% 1.74/1.16 unary 1
% 1.74/1.16 binary 2
% 1.74/1.16 lits 11
% 1.74/1.16 lits eq 0
% 1.74/1.16 fd_pure 0
% 1.74/1.16 fd_pseudo 0
% 1.74/1.16 fd_cond 0
% 1.74/1.16 fd_pseudo_cond 0
% 1.74/1.16 AC symbols 0
% 1.74/1.16
% 1.74/1.16 ------ Schedule dynamic 5 is on
% 1.74/1.16
% 1.74/1.16 ------ no conjectures: strip conj schedule
% 1.74/1.16
% 1.74/1.16 ------ no equalities: superposition off
% 1.74/1.16
% 1.74/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 ------
% 1.74/1.16 Current options:
% 1.74/1.16 ------
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 ------ Proving...
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 % SZS status Theorem for theBenchmark.p
% 1.74/1.16
% 1.74/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.74/1.16
% 1.74/1.16
%------------------------------------------------------------------------------