TSTP Solution File: PUZ020-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ020-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 : n032.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:58 EDT 2022
% Result : Unsatisfiable 0.11s 0.30s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : PUZ020-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.08 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Sun May 29 01:19:26 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.11/0.30 # No SInE strategy applied
% 0.11/0.30 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.30 #
% 0.11/0.30 # Presaturation interreduction done
% 0.11/0.30 # Number of axioms: 18 Number of unprocessed: 15
% 0.11/0.30 # Tableaux proof search.
% 0.11/0.30 # APR header successfully linked.
% 0.11/0.30 # Hello from C++
% 0.11/0.30 # The folding up rule is enabled...
% 0.11/0.30 # Local unification is enabled...
% 0.11/0.30 # Any saturation attempts will use folding labels...
% 0.11/0.30 # 15 beginning clauses after preprocessing and clausification
% 0.11/0.30 # Creating start rules for all 1 conjectures.
% 0.11/0.30 # There are 1 start rule candidates:
% 0.11/0.30 # Found 8 unit axioms.
% 0.11/0.30 # 1 start rule tableaux created.
% 0.11/0.30 # 7 extension rule candidate clauses
% 0.11/0.30 # 8 unit axiom clauses
% 0.11/0.30
% 0.11/0.30 # Requested 8, 32 cores available to the main process.
% 0.11/0.30 # There are not enough tableaux to fork, creating more from the initial 1
% 0.11/0.30 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.11/0.30 # There were 0 total branch saturation attempts.
% 0.11/0.30 # There were 0 of these attempts blocked.
% 0.11/0.30 # There were 0 deferred branch saturation attempts.
% 0.11/0.30 # There were 0 free duplicated saturations.
% 0.11/0.30 # There were 0 total successful branch saturations.
% 0.11/0.30 # There were 0 successful branch saturations in interreduction.
% 0.11/0.30 # There were 0 successful branch saturations on the branch.
% 0.11/0.30 # There were 0 successful branch saturations after the branch.
% 0.11/0.30 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.30 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.30 # Begin clausification derivation
% 0.11/0.30
% 0.11/0.30 # End clausification derivation
% 0.11/0.30 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.30 cnf(i_0_30, hypothesis, (person(husband))).
% 0.11/0.30 cnf(i_0_31, hypothesis, (person(wife))).
% 0.11/0.30 cnf(i_0_33, hypothesis, (says(husband,statement_by(husband)))).
% 0.11/0.30 cnf(i_0_37, hypothesis, (a_truth(statement_by(husband)))).
% 0.11/0.30 cnf(i_0_32, hypothesis, (wife!=husband)).
% 0.11/0.30 cnf(i_0_38, negated_conjecture, (~knight(husband))).
% 0.11/0.30 cnf(i_0_23, plain, (~says(X1,X1))).
% 0.11/0.30 cnf(i_0_25, plain, (~person(statement_by(X1)))).
% 0.11/0.30 cnf(i_0_21, plain, (~knave(X1)|~knight(X1)|~person(X1))).
% 0.11/0.30 cnf(i_0_26, plain, (knight(X1)|~a_truth(statement_by(X1))|~person(X1))).
% 0.11/0.30 cnf(i_0_20, plain, (knave(X1)|knight(X1)|~person(X1))).
% 0.11/0.30 cnf(i_0_27, plain, (a_truth(statement_by(X1))|knave(X1)|~person(X1))).
% 0.11/0.30 cnf(i_0_24, plain, (X1=statement_by(X2)|~says(X2,X1))).
% 0.11/0.30 cnf(i_0_29, plain, (~a_truth(X1)|~says(X2,X1)|~knave(X2))).
% 0.11/0.30 cnf(i_0_28, plain, (a_truth(X1)|~says(X2,X1)|~knight(X2))).
% 0.11/0.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.30 # Begin printing tableau
% 0.11/0.30 # Found 4 steps
% 0.11/0.30 cnf(i_0_38, negated_conjecture, (~knight(husband)), inference(start_rule)).
% 0.11/0.30 cnf(i_0_41, plain, (~knight(husband)), inference(extension_rule, [i_0_26])).
% 0.11/0.30 cnf(i_0_46, plain, (~a_truth(statement_by(husband))), inference(closure_rule, [i_0_37])).
% 0.11/0.30 cnf(i_0_47, plain, (~person(husband)), inference(closure_rule, [i_0_30])).
% 0.11/0.30 # End printing tableau
% 0.11/0.30 # SZS output end
% 0.11/0.30 # Branches closed with saturation will be marked with an "s"
% 0.11/0.30 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.30 # We now have 1 tableaux to operate on
% 0.11/0.30 # Found closed tableau during pool population.
% 0.11/0.30 # Proof search is over...
% 0.11/0.30 # Freeing feature tree
%------------------------------------------------------------------------------