%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM435+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n131.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:19 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 13 unt; 0 def)
% Number of atoms : 108 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 127 ( 59 ~; 55 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& ~ equal(xp,sz00)
& aInteger0(xq)
& ~ equal(xq,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1',m__979) ).
fof(14,conjecture,
equal(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xq,sdtasdt0(xp,xm))),
file('/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1',m__) ).
fof(15,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> equal(sdtasdt0(X1,sdtasdt0(X2,X3)),sdtasdt0(sdtasdt0(X1,X2),X3)) ),
file('/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1',mMulAsso) ).
fof(17,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1',mIntMult) ).
fof(19,axiom,
( aInteger0(xm)
& equal(sdtasdt0(sdtasdt0(xp,xq),xm),sdtpldt0(xa,smndt0(xb))) ),
file('/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1',m__1032) ).
fof(23,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1',mMulComm) ).
fof(27,negated_conjecture,
~ equal(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xq,sdtasdt0(xp,xm))),
inference(assume_negation,[status(cth)],[14]) ).
fof(28,negated_conjecture,
~ equal(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xq,sdtasdt0(xp,xm))),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
cnf(72,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(74,plain,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(82,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[28]) ).
fof(83,plain,
! [X1,X2,X3] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| equal(sdtasdt0(X1,sdtasdt0(X2,X3)),sdtasdt0(sdtasdt0(X1,X2),X3)) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(84,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| equal(sdtasdt0(X4,sdtasdt0(X5,X6)),sdtasdt0(sdtasdt0(X4,X5),X6)) ),
inference(variable_rename,[status(thm)],[83]) ).
cnf(85,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[84]) ).
fof(89,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(90,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[89]) ).
cnf(91,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(95,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(96,plain,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[19]) ).
fof(106,plain,
! [X1,X2] :
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(107,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| equal(sdtasdt0(X3,X4),sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[106]) ).
cnf(108,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[107]) ).
cnf(122,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(sdtasdt0(xp,xq),xm),
inference(rw,[status(thm)],[82,95,theory(equality)]) ).
cnf(227,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
| ~ aInteger0(xm)
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[122,85,theory(equality)]) ).
cnf(239,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aInteger0(X3)
| ~ aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[108,85,theory(equality)]) ).
cnf(245,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
| $false
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[227,96,theory(equality)]) ).
cnf(246,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
| $false
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[245,72,theory(equality)]) ).
cnf(247,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
| $false
| $false
| $false ),
inference(rw,[status(thm)],[246,74,theory(equality)]) ).
cnf(248,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[247,theory(equality)]) ).
cnf(2077,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X3) ),
inference(csr,[status(thm)],[239,91]) ).
cnf(2088,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xm,xq)) != sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(xq)
| ~ aInteger0(xm)
| ~ aInteger0(xp) ),
inference(spm,[status(thm)],[248,2077,theory(equality)]) ).
cnf(2244,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xm,xq)) != sdtasdt0(xp,sdtasdt0(xq,xm))
| $false
| ~ aInteger0(xm)
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[2088,72,theory(equality)]) ).
cnf(2245,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xm,xq)) != sdtasdt0(xp,sdtasdt0(xq,xm))
| $false
| $false
| ~ aInteger0(xp) ),
inference(rw,[status(thm)],[2244,96,theory(equality)]) ).
cnf(2246,negated_conjecture,
( sdtasdt0(xp,sdtasdt0(xm,xq)) != sdtasdt0(xp,sdtasdt0(xq,xm))
| $false
| $false
| $false ),
inference(rw,[status(thm)],[2245,74,theory(equality)]) ).
cnf(2247,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xq)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[2246,theory(equality)]) ).
cnf(2377,negated_conjecture,
( ~ aInteger0(xq)
| ~ aInteger0(xm) ),
inference(spm,[status(thm)],[2247,108,theory(equality)]) ).
cnf(2379,negated_conjecture,
( $false
| ~ aInteger0(xm) ),
inference(rw,[status(thm)],[2377,72,theory(equality)]) ).
cnf(2380,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[2379,96,theory(equality)]) ).
cnf(2381,negated_conjecture,
$false,
inference(cn,[status(thm)],[2380,theory(equality)]) ).
cnf(2382,negated_conjecture,
$false,
2381,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM435+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n131.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 03:37:45 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.06/0.37 -running prover on /export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpBM6tiN/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------