TSTP Solution File: ALG194+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG194+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:04:11 EDT 2024
% Result : Theorem 0.48s 1.15s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 39 ( 1 unt; 0 def)
% Number of atoms : 207 ( 175 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 276 ( 108 ~; 108 |; 60 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,conjecture,
( ( ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) ) )
| ( e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) )
| ( e6 != op(e6,e6)
& e5 != op(e5,e5)
& e4 != op(e4,e4)
& e3 != op(e3,e3)
& e2 != op(e2,e2)
& e1 != op(e1,e1)
& e0 != op(e0,e0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f7,negated_conjecture,
~ ( ( ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) ) )
| ( e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) )
| ( e6 != op(e6,e6)
& e5 != op(e5,e5)
& e4 != op(e4,e4)
& e3 != op(e3,e3)
& e2 != op(e2,e2)
& e1 != op(e1,e1)
& e0 != op(e0,e0) ) ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,plain,
( ( ( e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) )
| ( e6 != op(e6,e6)
& e5 != op(e5,e5)
& e4 != op(e4,e4)
& e3 != op(e3,e3)
& e2 != op(e2,e2)
& e1 != op(e1,e1)
& e0 != op(e0,e0) ) )
& ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f9,plain,
( ( e6 != op(e6,e6)
& e5 != op(e5,e5)
& e4 != op(e4,e4)
& e3 != op(e3,e3)
& e2 != op(e2,e2)
& e1 != op(e1,e1)
& e0 != op(e0,e0) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f10,plain,
( ( ( e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) )
| sP0 )
& ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) ) ),
inference(definition_folding,[],[f8,f9]) ).
fof(f11,plain,
( ( e6 != op(e6,e6)
& e5 != op(e5,e5)
& e4 != op(e4,e4)
& e3 != op(e3,e3)
& e2 != op(e2,e2)
& e1 != op(e1,e1)
& e0 != op(e0,e0) )
| ~ sP0 ),
inference(nnf_transformation,[],[f9]) ).
fof(f523,plain,
( e0 != op(e0,e0)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f524,plain,
( e1 != op(e1,e1)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f525,plain,
( e2 != op(e2,e2)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f526,plain,
( e3 != op(e3,e3)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f527,plain,
( e4 != op(e4,e4)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f528,plain,
( e5 != op(e5,e5)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f529,plain,
( e6 != op(e6,e6)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f530,plain,
( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f531,plain,
( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f532,plain,
( e0 = op(e0,e0)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f533,plain,
( e1 = op(e1,e1)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f534,plain,
( e2 = op(e2,e2)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f535,plain,
( e3 = op(e3,e3)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f536,plain,
( e4 = op(e4,e4)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f537,plain,
( e5 = op(e5,e5)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f538,plain,
( e6 = op(e6,e6)
| sP0 ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_560,plain,
( op(e6,e6) != e6
| ~ sP0 ),
inference(cnf_transformation,[],[f529]) ).
cnf(c_561,plain,
( op(e5,e5) != e5
| ~ sP0 ),
inference(cnf_transformation,[],[f528]) ).
cnf(c_562,plain,
( op(e4,e4) != e4
| ~ sP0 ),
inference(cnf_transformation,[],[f527]) ).
cnf(c_563,plain,
( op(e3,e3) != e3
| ~ sP0 ),
inference(cnf_transformation,[],[f526]) ).
cnf(c_564,plain,
( op(e2,e2) != e2
| ~ sP0 ),
inference(cnf_transformation,[],[f525]) ).
cnf(c_565,plain,
( op(e1,e1) != e1
| ~ sP0 ),
inference(cnf_transformation,[],[f524]) ).
cnf(c_566,plain,
( op(e0,e0) != e0
| ~ sP0 ),
inference(cnf_transformation,[],[f523]) ).
cnf(c_567,negated_conjecture,
( op(e6,e6) = e6
| sP0 ),
inference(cnf_transformation,[],[f538]) ).
cnf(c_568,negated_conjecture,
( op(e5,e5) = e5
| sP0 ),
inference(cnf_transformation,[],[f537]) ).
cnf(c_569,negated_conjecture,
( op(e4,e4) = e4
| sP0 ),
inference(cnf_transformation,[],[f536]) ).
cnf(c_570,negated_conjecture,
( op(e3,e3) = e3
| sP0 ),
inference(cnf_transformation,[],[f535]) ).
cnf(c_571,negated_conjecture,
( op(e2,e2) = e2
| sP0 ),
inference(cnf_transformation,[],[f534]) ).
cnf(c_572,negated_conjecture,
( op(e1,e1) = e1
| sP0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_573,negated_conjecture,
( op(e0,e0) = e0
| sP0 ),
inference(cnf_transformation,[],[f532]) ).
cnf(c_574,negated_conjecture,
( op(e6,e6) != e6
| op(e5,e5) != e5
| op(e4,e4) != e4
| op(e3,e3) != e3
| op(e2,e2) != e2
| op(e1,e1) != e1
| op(e0,e0) != e0 ),
inference(cnf_transformation,[],[f531]) ).
cnf(c_575,negated_conjecture,
( op(e6,e6) = e6
| op(e5,e5) = e5
| op(e4,e4) = e4
| op(e3,e3) = e3
| op(e2,e2) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0 ),
inference(cnf_transformation,[],[f530]) ).
cnf(c_576,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_574,c_575,c_560,c_561,c_562,c_563,c_564,c_565,c_566,c_567,c_568,c_569,c_570,c_571,c_572,c_573]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ALG194+1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 22:31:49 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/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.48/1.15 % SZS status Started for theBenchmark.p
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.15
% 0.48/1.15 ------ iProver source info
% 0.48/1.15
% 0.48/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.15 git: non_committed_changes: false
% 0.48/1.15
% 0.48/1.15 ------ Parsing...
% 0.48/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing...
% 0.48/1.15
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.15
% 0.48/1.15
%------------------------------------------------------------------------------