TSTP Solution File: NUM341+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM341+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n041.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:02:10 EST 2018
% Result : Theorem 0.15s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 22 ~; 26 |; 10 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 51 ( 12 sgn 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X7,X4] :
( sum(X7,X4,X1)
<=> difference(X1,X7,X4) ),
file('/export/starexec/sandbox/tmp/tmpilf_Mu/sel_theBenchmark.p_1',minus_entry_point) ).
fof(9,conjecture,
? [X1,X7,X4] :
( sum(X1,X7,X4)
<=> ( difference(X4,X7,X1)
& difference(X4,X1,X7) ) ),
file('/export/starexec/sandbox/tmp/tmpilf_Mu/sel_theBenchmark.p_1',add_same_as_subtract) ).
fof(10,negated_conjecture,
~ ? [X1,X7,X4] :
( sum(X1,X7,X4)
<=> ( difference(X4,X7,X1)
& difference(X4,X1,X7) ) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(20,plain,
! [X1,X7,X4] :
( ( ~ sum(X7,X4,X1)
| difference(X1,X7,X4) )
& ( ~ difference(X1,X7,X4)
| sum(X7,X4,X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(21,plain,
! [X8,X9,X10] :
( ( ~ sum(X9,X10,X8)
| difference(X8,X9,X10) )
& ( ~ difference(X8,X9,X10)
| sum(X9,X10,X8) ) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(22,plain,
( sum(X1,X2,X3)
| ~ difference(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( difference(X1,X2,X3)
| ~ sum(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(32,negated_conjecture,
! [X1,X7,X4] :
( ( ~ sum(X1,X7,X4)
| ~ difference(X4,X7,X1)
| ~ difference(X4,X1,X7) )
& ( sum(X1,X7,X4)
| ( difference(X4,X7,X1)
& difference(X4,X1,X7) ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(33,negated_conjecture,
! [X8,X9,X10] :
( ( ~ sum(X8,X9,X10)
| ~ difference(X10,X9,X8)
| ~ difference(X10,X8,X9) )
& ( sum(X8,X9,X10)
| ( difference(X10,X9,X8)
& difference(X10,X8,X9) ) ) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,negated_conjecture,
! [X8,X9,X10] :
( ( ~ sum(X8,X9,X10)
| ~ difference(X10,X9,X8)
| ~ difference(X10,X8,X9) )
& ( difference(X10,X9,X8)
| sum(X8,X9,X10) )
& ( difference(X10,X8,X9)
| sum(X8,X9,X10) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(35,negated_conjecture,
( sum(X1,X2,X3)
| difference(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(37,negated_conjecture,
( ~ difference(X1,X2,X3)
| ~ difference(X1,X3,X2)
| ~ sum(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(38,plain,
sum(X1,X2,X3),
inference(csr,[status(thm)],[22,35]) ).
cnf(41,plain,
( difference(X1,X2,X3)
| $false ),
inference(rw,[status(thm)],[23,38,theory(equality)]) ).
cnf(42,plain,
difference(X1,X2,X3),
inference(cn,[status(thm)],[41,theory(equality)]) ).
cnf(65,negated_conjecture,
( $false
| ~ difference(X1,X3,X2)
| ~ difference(X1,X2,X3) ),
inference(rw,[status(thm)],[37,38,theory(equality)]) ).
cnf(66,negated_conjecture,
( $false
| $false
| ~ difference(X1,X2,X3) ),
inference(rw,[status(thm)],[65,42,theory(equality)]) ).
cnf(67,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[66,42,theory(equality)]) ).
cnf(68,negated_conjecture,
$false,
inference(cn,[status(thm)],[67,theory(equality)]) ).
cnf(69,negated_conjecture,
$false,
68,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM341+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n041.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 01:20:15 CST 2018
% 0.06/0.23 % CPUTime :
% 0.06/0.43 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.43 --creating new selector for [NUM005+0.ax, NUM005+1.ax, NUM005+2.ax]
% 0.15/1.26 -running prover on /export/starexec/sandbox/tmp/tmpilf_Mu/sel_theBenchmark.p_1 with time limit 29
% 0.15/1.26 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpilf_Mu/sel_theBenchmark.p_1']
% 0.15/1.26 -prover status Theorem
% 0.15/1.26 Problem theBenchmark.p solved in phase 0.
% 0.15/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/1.26 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/1.27 Solved 1 out of 1.
% 0.15/1.27 # Problem is unsatisfiable (or provable), constructing proof object
% 0.15/1.27 # SZS status Theorem
% 0.15/1.27 # SZS output start CNFRefutation.
% See solution above
% 0.15/1.27 # SZS output end CNFRefutation
%------------------------------------------------------------------------------