TSTP Solution File: PUZ007-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ007-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ007-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 2 5)
% (binary-unit 9 #f 2 5)
% (binary-double 9 #f 2 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 5)
% (binary-order 25 #f 2 5)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(29,40,0,58,0,0)
%
%
% START OF PROOF
% 31 [] from_venus(X) | from_mars(X).
% 32 [] -from_venus(X) | -from_mars(X).
% 33 [] female(X) | male(X).
% 35 [] liar(X) | truthteller(X).
% 36 [] -liar(X) | -truthteller(X).
% 41 [] -female(X) | -from_venus(X) | truthteller(X).
% 44 [] -female(X) | -from_mars(X) | liar(X).
% 45 [] -says(X,Y) | -truthteller(X) | a_truth(Y).
% 46 [] -says(X,Y) | -a_truth(Y) | -liar(X).
% 47 [] says(a,a_from_mars).
% 48 [] says(b,a_has_lied).
% 49 [] -from_mars(a) | a_truth(a_from_mars).
% 50 [] -a_truth(a_from_mars) | from_mars(a).
% 51 [] -a_truth(statement_by(b)) | -a_truth(a_from_mars).
% 53 [] equal(statement_by(b),a_has_lied).
% 54 [] a_truth(a_from_mars) | a_truth(a_has_lied).
% 56 [] -male(a) | female(b).
% 57 [] from_mars(b) | from_mars(a).
% 58 [] from_venus(a) | from_venus(b).
% 64 [hyper:49,31] a_truth(a_from_mars) | from_venus(a).
% 85 [hyper:45,35,47] a_truth(a_from_mars) | liar(a).
% 86 [hyper:45,35,48] a_truth(a_has_lied) | liar(b).
% 94 [hyper:50,54] a_truth(a_has_lied) | from_mars(a).
% 106 [hyper:49,57] a_truth(a_from_mars) | from_mars(b).
% 139 [hyper:46,64,47,35] truthteller(a) | from_venus(a).
% 172 [hyper:50,85] liar(a) | from_mars(a).
% 186 [hyper:32,94,58] a_truth(a_has_lied) | from_venus(b).
% 214 [hyper:51,106,86,demod:53] liar(b) | from_mars(b).
% 230 [hyper:41,139,33] truthteller(a) | male(a).
% 240 [hyper:44,172,33] liar(a) | male(a).
% 292 [hyper:36,230,binarycut:240] male(a).
% 303 [hyper:56,292] female(b).
% 320 [hyper:44,303,214] liar(b).
% 329 [hyper:46,320,186,cut:48] from_venus(b).
% 348 [hyper:41,329,cut:303] truthteller(b).
% 350 [hyper:36,348,cut:320] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 2
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 50
% derived clauses: 624
% kept clauses: 75
% kept size sum: 354
% kept mid-nuclei: 179
% kept new demods: 2
% forw unit-subs: 41
% forw double-subs: 265
% forw overdouble-subs: 5
% backward subs: 29
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 59
% length fails: 0
% strength fails: 0
% predlist fails: 51
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 6
% full subs fail: 3
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ007-1+eq_r.in")
%
%------------------------------------------------------------------------------