TSTP Solution File: PUZ028-5 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ028-5 : TPTP v8.1.0. Released v2.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 : n021.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 : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ028-5 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat May 28 19:57:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.19/0.37 # and selection function SelectCQIPrecW.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 15 Number of unprocessed: 15
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 15 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 2 conjectures.
% 0.19/0.37 # There are 2 start rule candidates:
% 0.19/0.37 # Found 11 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 2 start rule tableaux created.
% 0.19/0.37 # 4 extension rule candidate clauses
% 0.19/0.37 # 11 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.19/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 8 tableaux to operate on
% 0.19/0.47 # There were 4 total branch saturation attempts.
% 0.19/0.47 # There were 0 of these attempts blocked.
% 0.19/0.47 # There were 0 deferred branch saturation attempts.
% 0.19/0.47 # There were 0 free duplicated saturations.
% 0.19/0.47 # There were 4 total successful branch saturations.
% 0.19/0.47 # There were 0 successful branch saturations in interreduction.
% 0.19/0.47 # There were 0 successful branch saturations on the branch.
% 0.19/0.47 # There were 4 successful branch saturations after the branch.
% 0.19/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Begin clausification derivation
% 0.19/0.47
% 0.19/0.47 # End clausification derivation
% 0.19/0.47 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.47 cnf(i_0_16, plain, (person(one))).
% 0.19/0.47 cnf(i_0_17, plain, (person(two))).
% 0.19/0.47 cnf(i_0_18, plain, (person(three))).
% 0.19/0.47 cnf(i_0_19, plain, (person(four))).
% 0.19/0.47 cnf(i_0_20, plain, (person(five))).
% 0.19/0.47 cnf(i_0_21, plain, (person(six))).
% 0.19/0.47 cnf(i_0_22, plain, (after(one,two))).
% 0.19/0.47 cnf(i_0_23, plain, (after(two,three))).
% 0.19/0.47 cnf(i_0_24, plain, (after(three,four))).
% 0.19/0.47 cnf(i_0_25, plain, (after(four,five))).
% 0.19/0.47 cnf(i_0_26, plain, (after(five,six))).
% 0.19/0.47 cnf(i_0_29, negated_conjecture, (~familiar(X1,X2)|~familiar(X3,X2)|~familiar(X3,X1))).
% 0.19/0.47 cnf(i_0_30, negated_conjecture, (~not_familiar(X1,X2)|~not_familiar(X3,X2)|~not_familiar(X3,X1))).
% 0.19/0.47 cnf(i_0_28, plain, (not_familiar(X1,X2)|familiar(X1,X2)|~after(X1,X2)|~person(X2)|~person(X1))).
% 0.19/0.47 cnf(i_0_27, plain, (after(X1,X2)|~after(X3,X2)|~after(X1,X3))).
% 0.19/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.47 # Begin printing tableau
% 0.19/0.47 # Found 18 steps
% 0.19/0.47 cnf(i_0_29, negated_conjecture, (~familiar(two,three)|~familiar(one,three)|~familiar(one,two)), inference(start_rule)).
% 0.19/0.47 cnf(i_0_36, plain, (~familiar(one,two)), inference(extension_rule, [i_0_28])).
% 0.19/0.47 cnf(i_0_109, plain, (~after(one,two)), inference(closure_rule, [i_0_22])).
% 0.19/0.47 cnf(i_0_110, plain, (~person(two)), inference(closure_rule, [i_0_17])).
% 0.19/0.47 cnf(i_0_111, plain, (~person(one)), inference(closure_rule, [i_0_16])).
% 0.19/0.47 cnf(i_0_107, plain, (not_familiar(one,two)), inference(extension_rule, [i_0_30])).
% 0.19/0.47 cnf(i_0_130, plain, (~not_familiar(one,two)), inference(closure_rule, [i_0_107])).
% 0.19/0.47 cnf(i_0_129, plain, (~not_familiar(two,two)), inference(extension_rule, [i_0_28])).
% 0.19/0.47 cnf(i_0_138, plain, (~person(two)), inference(closure_rule, [i_0_17])).
% 0.19/0.47 cnf(i_0_139, plain, (~person(two)), inference(closure_rule, [i_0_17])).
% 0.19/0.47 cnf(i_0_34, plain, (~familiar(two,three)), inference(extension_rule, [i_0_28])).
% 0.19/0.47 cnf(i_0_151, plain, (~after(two,three)), inference(closure_rule, [i_0_23])).
% 0.19/0.47 cnf(i_0_152, plain, (~person(three)), inference(closure_rule, [i_0_18])).
% 0.19/0.47 cnf(i_0_153, plain, (~person(two)), inference(closure_rule, [i_0_17])).
% 0.19/0.47 cnf(i_0_35, plain, (~familiar(one,three)), inference(etableau_closure_rule, [i_0_35, ...])).
% 0.19/0.47 cnf(i_0_136, plain, (familiar(two,two)), inference(etableau_closure_rule, [i_0_136, ...])).
% 0.19/0.47 cnf(i_0_137, plain, (~after(two,two)), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.19/0.47 cnf(i_0_149, plain, (not_familiar(two,three)), inference(etableau_closure_rule, [i_0_149, ...])).
% 0.19/0.47 # End printing tableau
% 0.19/0.47 # SZS output end
% 0.19/0.47 # Branches closed with saturation will be marked with an "s"
% 0.19/0.47 # Child (30210) has found a proof.
% 0.19/0.47
% 0.19/0.47 # Proof search is over...
% 0.19/0.47 # Freeing feature tree
%------------------------------------------------------------------------------