TSTP Solution File: PUZ028-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : PUZ028-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n017.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  : 600s
% DateTime : Mon Jul 18 18:10:59 EDT 2022

% Result   : Satisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : PUZ028-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat May 28 19:52:53 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.13/0.36  # and selection function SelectCQIPrecW.
% 0.13/0.36  #
% 0.13/0.36  # Presaturation interreduction done
% 0.13/0.36  # Number of axioms: 15 Number of unprocessed: 15
% 0.13/0.36  # Tableaux proof search.
% 0.13/0.36  # APR header successfully linked.
% 0.13/0.36  # Hello from C++
% 0.13/0.36  # The folding up rule is enabled...
% 0.13/0.36  # Local unification is enabled...
% 0.13/0.36  # Any saturation attempts will use folding labels...
% 0.13/0.36  # 15 beginning clauses after preprocessing and clausification
% 0.13/0.36  # Creating start rules for all 2 conjectures.
% 0.13/0.36  # There are 2 start rule candidates:
% 0.13/0.36  # Found 11 unit axioms.
% 0.13/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36  # 2 start rule tableaux created.
% 0.13/0.36  # 4 extension rule candidate clauses
% 0.13/0.36  # 11 unit axiom clauses
% 0.13/0.36  
% 0.13/0.36  # Requested 8, 32 cores available to the main process.
% 0.13/0.36  # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.36  # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36  # We now have 8 tableaux to operate on
% 0.13/0.37  # 9207 Satisfiable branch
% 0.13/0.37  # Satisfiable branch found.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 0 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 0 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_16, plain, (person(one))).
% 0.13/0.37  cnf(i_0_17, plain, (person(two))).
% 0.13/0.37  cnf(i_0_18, plain, (person(three))).
% 0.13/0.37  cnf(i_0_19, plain, (person(four))).
% 0.13/0.37  cnf(i_0_20, plain, (person(five))).
% 0.13/0.37  cnf(i_0_21, plain, (person(six))).
% 0.13/0.37  cnf(i_0_22, plain, (after(one,two))).
% 0.13/0.37  cnf(i_0_23, plain, (after(two,three))).
% 0.13/0.37  cnf(i_0_24, plain, (after(three,four))).
% 0.13/0.37  cnf(i_0_25, plain, (after(four,five))).
% 0.13/0.37  cnf(i_0_26, plain, (after(five,six))).
% 0.13/0.37  cnf(i_0_29, negated_conjecture, (~familiar(X1,X2)|~familiar(X3,X1)|~familiar(X2,X3))).
% 0.13/0.37  cnf(i_0_30, negated_conjecture, (~not_familiar(X1,X2)|~not_familiar(X3,X1)|~not_familiar(X2,X3))).
% 0.13/0.37  cnf(i_0_28, plain, (not_familiar(X1,X2)|familiar(X1,X2)|~after(X1,X2)|~person(X2)|~person(X1))).
% 0.13/0.37  cnf(i_0_27, plain, (after(X1,X2)|~after(X3,X2)|~after(X1,X3))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 15 steps
% 0.13/0.37  cnf(i_0_30, negated_conjecture, (~not_familiar(one,one)|~not_familiar(two,one)|~not_familiar(one,two)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_33, plain, (~not_familiar(one,two)), inference(extension_rule, [i_0_28])).
% 0.13/0.37  cnf(i_0_67, plain, (~after(one,two)), inference(closure_rule, [i_0_22])).
% 0.13/0.37  cnf(i_0_68, plain, (~person(two)), inference(closure_rule, [i_0_17])).
% 0.13/0.37  cnf(i_0_69, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_66, plain, (familiar(one,two)), inference(extension_rule, [i_0_29])).
% 0.13/0.37  cnf(i_0_147, plain, (~familiar(one,one)), inference(extension_rule, [i_0_28])).
% 0.13/0.37  cnf(i_0_152, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_153, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_148, plain, (~familiar(two,one)), inference(extension_rule, [i_0_28])).
% 0.13/0.37  cnf(i_0_166, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_167, plain, (~person(two)), inference(closure_rule, [i_0_17])).
% 0.13/0.37  cnf(i_0_31, plain, (~not_familiar(one,one)), inference(extension_rule, [i_0_28])).
% 0.13/0.37  cnf(i_0_180, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.13/0.37  cnf(i_0_181, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Child (9207) has found a proof.
% 0.13/0.37  
% 0.13/0.37  # Proof search is over...
% 0.13/0.37  # Freeing feature tree
%------------------------------------------------------------------------------