TSTP Solution File: GEO504+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO504+1 : TPTP v7.0.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n056.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.75MB
% OS : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Fri Jan 20 10:18:35 EST 2017
% Result : Theorem 0.91s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 17 unt; 0 def)
% Number of atoms : 75 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 34 ~; 28 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn 70 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2,X5,X7,X10,X11] :
( ~ s_e(X1,X2,X5,X7)
| ~ s_e(X1,X2,X10,X11)
| s_e(X5,X7,X10,X11) ),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',aA2) ).
fof(21,axiom,
! [X16,X17,X12] : s_e(X16,X17,s(X12,X16),s(X12,X17)),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',aSatz7_13) ).
fof(26,conjecture,
! [X12,X13,X14] :
( ~ s_r(X12,X13,X14)
| s_r(X14,X13,X12) ),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',aSatz8_2) ).
fof(39,axiom,
! [X12,X13,X14,X15] :
( ~ s_e(X12,X13,X14,X15)
| s_e(X13,X12,X15,X14) ),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',aSatz2_14) ).
fof(47,axiom,
! [X12,X13,X14] :
( ( ~ s_r(X12,X13,X14)
| s_e(X12,X14,X12,s(X13,X14)) )
& ( s_r(X12,X13,X14)
| ~ s_e(X12,X14,X12,s(X13,X14)) ) ),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',d_Defn8_1) ).
fof(58,axiom,
! [X12,X16] : equal(s(X12,s(X12,X16)),X16),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',aSatz7_7) ).
fof(116,axiom,
! [X12,X13,X14,X15] :
( ~ s_e(X12,X13,X14,X15)
| s_e(X14,X15,X12,X13) ),
file('/export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1',aSatz2_2) ).
fof(131,negated_conjecture,
~ ! [X12,X13,X14] :
( ~ s_r(X12,X13,X14)
| s_r(X14,X13,X12) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(135,plain,
! [X1,X2,X5,X7,X10,X11] :
( ~ s_e(X1,X2,X5,X7)
| ~ s_e(X1,X2,X10,X11)
| s_e(X5,X7,X10,X11) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(151,negated_conjecture,
~ ! [X12,X13,X14] :
( ~ s_r(X12,X13,X14)
| s_r(X14,X13,X12) ),
inference(fof_simplification,[status(thm)],[131,theory(equality)]) ).
fof(158,plain,
! [X12,X13,X14,X15] :
( ~ s_e(X12,X13,X14,X15)
| s_e(X13,X12,X15,X14) ),
inference(fof_simplification,[status(thm)],[39,theory(equality)]) ).
fof(166,plain,
! [X12,X13,X14] :
( ( ~ s_r(X12,X13,X14)
| s_e(X12,X14,X12,s(X13,X14)) )
& ( s_r(X12,X13,X14)
| ~ s_e(X12,X14,X12,s(X13,X14)) ) ),
inference(fof_simplification,[status(thm)],[47,theory(equality)]) ).
fof(220,plain,
! [X12,X13,X14,X15] :
( ~ s_e(X12,X13,X14,X15)
| s_e(X14,X15,X12,X13) ),
inference(fof_simplification,[status(thm)],[116,theory(equality)]) ).
fof(243,plain,
! [X12,X13,X14,X15,X16,X17] :
( ~ s_e(X12,X13,X14,X15)
| ~ s_e(X12,X13,X16,X17)
| s_e(X14,X15,X16,X17) ),
inference(variable_rename,[status(thm)],[135]) ).
cnf(244,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X5,X6,X3,X4)
| ~ s_e(X5,X6,X1,X2) ),
inference(split_conjunct,[status(thm)],[243]) ).
fof(288,plain,
! [X18,X19,X20] : s_e(X18,X19,s(X20,X18),s(X20,X19)),
inference(variable_rename,[status(thm)],[21]) ).
cnf(289,plain,
s_e(X1,X2,s(X3,X1),s(X3,X2)),
inference(split_conjunct,[status(thm)],[288]) ).
fof(299,negated_conjecture,
? [X12,X13,X14] :
( s_r(X12,X13,X14)
& ~ s_r(X14,X13,X12) ),
inference(fof_nnf,[status(thm)],[151]) ).
fof(300,negated_conjecture,
? [X15,X16,X17] :
( s_r(X15,X16,X17)
& ~ s_r(X17,X16,X15) ),
inference(variable_rename,[status(thm)],[299]) ).
fof(301,negated_conjecture,
( s_r(esk1_0,esk2_0,esk3_0)
& ~ s_r(esk3_0,esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[300]) ).
cnf(302,negated_conjecture,
~ s_r(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[301]) ).
cnf(303,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[301]) ).
fof(334,plain,
! [X16,X17,X18,X19] :
( ~ s_e(X16,X17,X18,X19)
| s_e(X17,X16,X19,X18) ),
inference(variable_rename,[status(thm)],[158]) ).
cnf(335,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X2,X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[334]) ).
fof(356,plain,
! [X15,X16,X17] :
( ( ~ s_r(X15,X16,X17)
| s_e(X15,X17,X15,s(X16,X17)) )
& ( s_r(X15,X16,X17)
| ~ s_e(X15,X17,X15,s(X16,X17)) ) ),
inference(variable_rename,[status(thm)],[166]) ).
cnf(357,plain,
( s_r(X1,X3,X2)
| ~ s_e(X1,X2,X1,s(X3,X2)) ),
inference(split_conjunct,[status(thm)],[356]) ).
cnf(358,plain,
( s_e(X1,X2,X1,s(X3,X2))
| ~ s_r(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[356]) ).
fof(380,plain,
! [X17,X18] : equal(s(X17,s(X17,X18)),X18),
inference(variable_rename,[status(thm)],[58]) ).
cnf(381,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[380]) ).
fof(519,plain,
! [X16,X17,X18,X19] :
( ~ s_e(X16,X17,X18,X19)
| s_e(X18,X19,X16,X17) ),
inference(variable_rename,[status(thm)],[220]) ).
cnf(520,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[519]) ).
cnf(628,plain,
s_e(X1,s(X2,X3),s(X2,X1),X3),
inference(spm,[status(thm)],[289,381,theory(equality)]) ).
cnf(674,negated_conjecture,
s_e(esk1_0,esk3_0,esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[358,303,theory(equality)]) ).
cnf(1341,negated_conjecture,
s_e(esk1_0,s(esk2_0,esk3_0),esk1_0,esk3_0),
inference(spm,[status(thm)],[520,674,theory(equality)]) ).
cnf(1379,negated_conjecture,
( s_e(X1,X2,esk1_0,esk3_0)
| ~ s_e(esk1_0,s(esk2_0,esk3_0),X1,X2) ),
inference(spm,[status(thm)],[244,1341,theory(equality)]) ).
cnf(41578,negated_conjecture,
s_e(s(esk2_0,esk1_0),esk3_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[1379,628,theory(equality)]) ).
cnf(41618,negated_conjecture,
s_e(esk1_0,esk3_0,s(esk2_0,esk1_0),esk3_0),
inference(spm,[status(thm)],[520,41578,theory(equality)]) ).
cnf(41721,negated_conjecture,
s_e(esk3_0,esk1_0,esk3_0,s(esk2_0,esk1_0)),
inference(spm,[status(thm)],[335,41618,theory(equality)]) ).
cnf(42175,negated_conjecture,
s_r(esk3_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[357,41721,theory(equality)]) ).
cnf(42233,negated_conjecture,
$false,
inference(sr,[status(thm)],[42175,302,theory(equality)]) ).
cnf(42234,negated_conjecture,
$false,
42233,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO504+1 : TPTP v7.0.0. Released v7.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n056.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.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 20 05:38:47 CST 2017
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for [GEO011+0.ax]
% 0.91/1.38 -running prover on /export/starexec/sandbox/tmp/tmpMIFPcg/sel_theBenchmark.p_1 with time limit 29
% 0.91/1.38 -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/tmpMIFPcg/sel_theBenchmark.p_1']
% 0.91/1.38 -prover status Theorem
% 0.91/1.38 Problem theBenchmark.p solved in phase 0.
% 0.91/1.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.38 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.38 Solved 1 out of 1.
% 0.91/1.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.91/1.38 # SZS status Theorem
% 0.91/1.38 # SZS output start CNFRefutation.
% See solution above
% 0.91/1.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------