TSTP Solution File: CSR026+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR026+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:11:08 EDT 2024
% Result : Theorem 8.03s 1.65s
% Output : CNFRefutation 8.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 17 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 74 ( 34 ~; 28 |; 5 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f163,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_163) ).
fof(f254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_254) ).
fof(f315,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_315) ).
fof(f344,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_344) ).
fof(f364,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_364) ).
fof(f440,axiom,
! [X9] :
( ( runningshorts(X9)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(X9,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_440) ).
fof(f1123,axiom,
! [X19,X20] :
( ( genlmt(X19,X20)
& mtvisible(X19) )
=> mtvisible(X20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_1123) ).
fof(f1132,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query76) ).
fof(f1133,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(negated_conjecture,[],[f1132]) ).
fof(f1167,plain,
! [X0] :
( ( runningshorts(X0)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(X0,f_tptpquantityfn_2(n_756)) ),
inference(rectify,[],[f440]) ).
fof(f1788,plain,
! [X0,X1] :
( ( genlmt(X0,X1)
& mtvisible(X0) )
=> mtvisible(X1) ),
inference(rectify,[],[f1123]) ).
fof(f1966,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(ennf_transformation,[],[f163]) ).
fof(f2094,plain,
! [X0] :
( tptpofobject(X0,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(ennf_transformation,[],[f1167]) ).
fof(f2095,plain,
! [X0] :
( tptpofobject(X0,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(flattening,[],[f2094]) ).
fof(f2674,plain,
! [X0,X1] :
( mtvisible(X1)
| ~ genlmt(X0,X1)
| ~ mtvisible(X0) ),
inference(ennf_transformation,[],[f1788]) ).
fof(f2675,plain,
! [X0,X1] :
( mtvisible(X1)
| ~ genlmt(X0,X1)
| ~ mtvisible(X0) ),
inference(flattening,[],[f2674]) ).
fof(f2684,plain,
( ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))
& mtvisible(c_tptp_spindlecollectormt) ),
inference(ennf_transformation,[],[f1133]) ).
fof(f2846,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(cnf_transformation,[],[f1966]) ).
fof(f2937,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(cnf_transformation,[],[f254]) ).
fof(f2997,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(cnf_transformation,[],[f315]) ).
fof(f3026,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(cnf_transformation,[],[f344]) ).
fof(f3046,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(cnf_transformation,[],[f364]) ).
fof(f3122,plain,
! [X0] :
( tptpofobject(X0,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(cnf_transformation,[],[f2095]) ).
fof(f3715,plain,
! [X0,X1] :
( mtvisible(X1)
| ~ genlmt(X0,X1)
| ~ mtvisible(X0) ),
inference(cnf_transformation,[],[f2675]) ).
fof(f3724,plain,
mtvisible(c_tptp_spindlecollectormt),
inference(cnf_transformation,[],[f2684]) ).
fof(f3725,plain,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(cnf_transformation,[],[f2684]) ).
cnf(c_210,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(cnf_transformation,[],[f2846]) ).
cnf(c_301,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(cnf_transformation,[],[f2937]) ).
cnf(c_361,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(cnf_transformation,[],[f2997]) ).
cnf(c_390,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(cnf_transformation,[],[f3026]) ).
cnf(c_410,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(cnf_transformation,[],[f3046]) ).
cnf(c_486,plain,
( ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X0,f_tptpquantityfn_2(n_756)) ),
inference(cnf_transformation,[],[f3122]) ).
cnf(c_1079,plain,
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(cnf_transformation,[],[f3715]) ).
cnf(c_1088,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(cnf_transformation,[],[f3725]) ).
cnf(c_1089,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(cnf_transformation,[],[f3724]) ).
cnf(c_2593,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(prop_impl_just,[status(thm)],[c_210]) ).
cnf(c_11462,plain,
( ~ mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(resolution,[status(thm)],[c_2593,c_486]) ).
cnf(c_11463,plain,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ mtvisible(c_cyclistsmt) ),
inference(global_subsumption_just,[status(thm)],[c_11462,c_1088,c_11462]) ).
cnf(c_11464,plain,
( ~ mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(renaming,[status(thm)],[c_11463]) ).
cnf(c_23570,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| mtvisible(c_cyclistsmt) ),
inference(superposition,[status(thm)],[c_301,c_1079]) ).
cnf(c_23579,plain,
( ~ mtvisible(c_tptp_member3993_mt)
| mtvisible(c_tptp_spindleheadmt) ),
inference(superposition,[status(thm)],[c_361,c_1079]) ).
cnf(c_23587,plain,
( ~ mtvisible(c_tptp_spindlecollectormt)
| mtvisible(c_tptp_member2701_mt) ),
inference(superposition,[status(thm)],[c_390,c_1079]) ).
cnf(c_23591,plain,
( ~ mtvisible(c_tptp_spindlecollectormt)
| mtvisible(c_tptp_member3993_mt) ),
inference(superposition,[status(thm)],[c_410,c_1079]) ).
cnf(c_23610,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_23570,c_23579,c_23587,c_23591,c_11464,c_1089]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR026+2 : TPTP v8.1.2. Released v3.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 23:04:20 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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
% 8.03/1.65 % SZS status Started for theBenchmark.p
% 8.03/1.65 % SZS status Theorem for theBenchmark.p
% 8.03/1.65
% 8.03/1.65 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.03/1.65
% 8.03/1.65 ------ iProver source info
% 8.03/1.65
% 8.03/1.65 git: date: 2024-05-02 19:28:25 +0000
% 8.03/1.65 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.03/1.65 git: non_committed_changes: false
% 8.03/1.65
% 8.03/1.65 ------ Parsing...
% 8.03/1.65 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.03/1.65
% 8.03/1.65 ------ Preprocessing... sf_s rm: 30 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe:64:0s pe:128:0s pe_e
% 8.03/1.65
% 8.03/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.03/1.65 ------ Proving...
% 8.03/1.65 ------ Problem Properties
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65 clauses 770
% 8.03/1.65 conjectures 1
% 8.03/1.65 EPR 722
% 8.03/1.65 Horn 770
% 8.03/1.65 unary 272
% 8.03/1.65 binary 463
% 8.03/1.65 lits 1303
% 8.03/1.65 lits eq 0
% 8.03/1.65 fd_pure 0
% 8.03/1.65 fd_pseudo 0
% 8.03/1.65 fd_cond 0
% 8.03/1.65 fd_pseudo_cond 0
% 8.03/1.65 AC symbols 0
% 8.03/1.65
% 8.03/1.65 ------ Input Options Time Limit: Unbounded
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65 ------
% 8.03/1.65 Current options:
% 8.03/1.65 ------
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65 ------ Proving...
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65 ------ Proving...
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65 ------ Proving...
% 8.03/1.65
% 8.03/1.65
% 8.03/1.65 % SZS status Theorem for theBenchmark.p
% 8.03/1.65
% 8.03/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.03/1.65
% 8.03/1.65
%------------------------------------------------------------------------------