TSTP Solution File: SYN392+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN392+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 03:30:26 EDT 2024
% Result : Theorem 0.77s 1.21s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 1 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 128 ( 48 ~; 56 |; 15 &)
% ( 7 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( p1
<=> p2 )
<=> ( ( p1
| ~ p2 )
& ( ~ p1
| p2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel14) ).
fof(f2,negated_conjecture,
~ ( ( p1
<=> p2 )
<=> ( ( p1
| ~ p2 )
& ( ~ p1
| p2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ( p1
<=> p2 )
<~> ( ( p1
| ~ p2 )
& ( ~ p1
| p2 ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( sP0
<=> ( ( p1
| ~ p2 )
& ( ~ p1
| p2 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f5,plain,
( ( p1
<=> p2 )
<~> sP0 ),
inference(definition_folding,[],[f3,f4]) ).
fof(f6,plain,
( ( sP0
| ( ~ p1
& p2 )
| ( p1
& ~ p2 ) )
& ( ( ( p1
| ~ p2 )
& ( ~ p1
| p2 ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f7,plain,
( ( sP0
| ( ~ p1
& p2 )
| ( p1
& ~ p2 ) )
& ( ( ( p1
| ~ p2 )
& ( ~ p1
| p2 ) )
| ~ sP0 ) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
( ( ~ sP0
| ( ( ~ p2
| ~ p1 )
& ( p2
| p1 ) ) )
& ( sP0
| ( ( p1
| ~ p2 )
& ( p2
| ~ p1 ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f9,plain,
( ~ p1
| p2
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
( p1
| ~ p2
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
( sP0
| p2
| p1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
( sP0
| ~ p1
| ~ p2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
( sP0
| p2
| ~ p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
( sP0
| p1
| ~ p2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
( ~ sP0
| p2
| p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
( ~ sP0
| ~ p2
| ~ p1 ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,plain,
( ~ p1
| ~ p2
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,plain,
( sP0
| p1
| p2 ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,plain,
( ~ sP0
| ~ p2
| p1 ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_52,plain,
( ~ sP0
| ~ p1
| p2 ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_53,negated_conjecture,
( ~ sP0
| ~ p1
| ~ p2 ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_54,negated_conjecture,
( ~ sP0
| p1
| p2 ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_55,negated_conjecture,
( ~ p2
| sP0
| p1 ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_56,negated_conjecture,
( ~ p1
| sP0
| p2 ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_57,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_53,c_49,c_51,c_52,c_54,c_55,c_56,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN392+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.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 : Thu May 2 21:01:54 EDT 2024
% 0.13/0.34 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.77/1.21 % SZS status Started for theBenchmark.p
% 0.77/1.21 % SZS status Theorem for theBenchmark.p
% 0.77/1.21
% 0.77/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.77/1.21
% 0.77/1.21 ------ iProver source info
% 0.77/1.21
% 0.77/1.21 git: date: 2024-05-02 19:28:25 +0000
% 0.77/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.77/1.21 git: non_committed_changes: false
% 0.77/1.21
% 0.77/1.21 ------ Parsing...
% 0.77/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.77/1.21
% 0.77/1.21
% 0.77/1.21 ------ Preprocessing...
% 0.77/1.21
% 0.77/1.21 % SZS status Theorem for theBenchmark.p
% 0.77/1.21
% 0.77/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.77/1.21
% 0.77/1.21
%------------------------------------------------------------------------------