TSTP Solution File: HWC001-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWC001-1 : TPTP v8.1.0. Bugfixed v1.1.1.
% 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 : n024.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 : Sat Jul 16 13:07:04 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWC001-1 : TPTP v8.1.0. Bugfixed v1.1.1.
% 0.07/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 : n024.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 : Thu Jun 9 12:53:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 8 Number of unprocessed: 8
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 8 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 4 conjectures.
% 0.13/0.37 # There are 4 start rule candidates:
% 0.13/0.37 # Found 7 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 4 start rule tableaux created.
% 0.13/0.37 # 1 extension rule candidate clauses
% 0.13/0.37 # 7 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.13/0.37 # There were 2 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 2 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 2 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable 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_13, plain, (not(n0)=n1)).
% 0.13/0.37 cnf(i_0_14, plain, (not(n1)=n0)).
% 0.13/0.37 cnf(i_0_16, negated_conjecture, (output(n0,n0,n1,n1))).
% 0.13/0.37 cnf(i_0_17, negated_conjecture, (output(n0,n1,n0,n1))).
% 0.13/0.37 cnf(i_0_11, plain, (and(X1,n0)=n0)).
% 0.13/0.37 cnf(i_0_12, plain, (and(X1,n1)=X1)).
% 0.13/0.37 cnf(i_0_18, negated_conjecture, (~output(n0,n1,n1,n1))).
% 0.13/0.37 cnf(i_0_15, negated_conjecture, (output(not(and(X1,X2)),not(and(X3,X4)),not(and(X5,X6)),not(and(X7,X8)))|~output(X2,X4,X6,X8)|~output(X1,X3,X5,X7))).
% 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 6 steps
% 0.13/0.37 cnf(i_0_16, negated_conjecture, (output(n0,n0,n1,n1)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_24, plain, (output(n0,n0,n1,n1)), inference(extension_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_35, plain, (~output(n0,n1,n0,n1)), inference(closure_rule, [i_0_17])).
% 0.13/0.37 cnf(i_0_34, plain, (output(not(and(n0,n0)),not(and(n0,n1)),not(and(n1,n0)),not(and(n1,n1)))), inference(extension_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_38, plain, (~output(n0,n1,n0,n1)), inference(closure_rule, [i_0_17])).
% 0.13/0.37 cnf(i_0_37, plain, (output(not(and(not(and(n0,n0)),n0)),not(and(not(and(n0,n1)),n1)),not(and(not(and(n1,n0)),n0)),not(and(not(and(n1,n1)),n1)))), inference(etableau_closure_rule, [i_0_37, ...])).
% 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 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 7 tableaux to operate on
% 0.13/0.37 # Found closed tableau during pool population.
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------