TSTP Solution File: SWC205+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC205+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 20:41:40 EDT 2023
% Result : Theorem 1.06s 1.19s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f590)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != X3
| nil = sK55 )
& ( nil != sK55
| nil = X3 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != X3
| nil = sK55 )
& ( nil != sK55
| nil = X3 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK56
| nil = sK55 )
& ( nil != sK55
| nil = sK56 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( nil != sK56
| nil = sK55 )
& ( nil != sK55
| nil = sK56 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f438,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f554,f552]) ).
fof(f558,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f560,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f590]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_247,negated_conjecture,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_248,negated_conjecture,
~ neq(sK55,nil),
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f558]) ).
cnf(c_253,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f560]) ).
cnf(c_380,plain,
( nil != sK55
| nil = sK56 ),
inference(prop_impl_just,[status(thm)],[c_247]) ).
cnf(c_408,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(prop_impl_just,[status(thm)],[c_139]) ).
cnf(c_3672,plain,
( X0 != sK55
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_248]) ).
cnf(c_3673,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3672]) ).
cnf(c_3674,plain,
sK55 = nil,
inference(global_subsumption_just,[status(thm)],[c_3673,c_253,c_141,c_3673]) ).
cnf(c_3681,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_408,c_249]) ).
cnf(c_3682,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3681]) ).
cnf(c_3683,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3682,c_141,c_3682]) ).
cnf(c_3698,plain,
nil != sK55,
inference(backward_subsumption_resolution,[status(thm)],[c_380,c_3683]) ).
cnf(c_6502,plain,
nil != nil,
inference(demodulation,[status(thm)],[c_3698,c_3674]) ).
cnf(c_6503,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_6502]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC205+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n004.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 18:27:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.06/1.19 % SZS status Started for theBenchmark.p
% 1.06/1.19 % SZS status Theorem for theBenchmark.p
% 1.06/1.19
% 1.06/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.06/1.19
% 1.06/1.19 ------ iProver source info
% 1.06/1.19
% 1.06/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.06/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.06/1.19 git: non_committed_changes: false
% 1.06/1.19 git: last_make_outside_of_git: false
% 1.06/1.19
% 1.06/1.19 ------ Parsing...
% 1.06/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.06/1.19
% 1.06/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e
% 1.06/1.19
% 1.06/1.19 % SZS status Theorem for theBenchmark.p
% 1.06/1.19
% 1.06/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.06/1.19
% 1.06/1.19
%------------------------------------------------------------------------------