TSTP Solution File: SET012-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET012-4 : TPTP v8.1.0. Bugfixed v1.2.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 : n013.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 : Tue Jul 19 00:56:09 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET012-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 19:37:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.12/0.36 # and selection function SelectUnlessUniqMax.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 11 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 4 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 7 extension rule candidate clauses
% 0.12/0.37 # 4 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_20, hypothesis, (complement(as)=bs)).
% 0.12/0.37 cnf(i_0_21, hypothesis, (complement(bs)=cs)).
% 0.12/0.37 cnf(i_0_22, negated_conjecture, (as!=cs)).
% 0.12/0.37 cnf(i_0_18, plain, (~member(X1,empty_set))).
% 0.12/0.37 cnf(i_0_19, plain, (member(X1,universal_set)|~little_set(X1))).
% 0.12/0.37 cnf(i_0_12, plain, (little_set(X1)|~member(X1,X2))).
% 0.12/0.37 cnf(i_0_13, plain, (X1=X2|little_set(f1(X1,X2)))).
% 0.12/0.37 cnf(i_0_16, plain, (~member(X1,complement(X2))|~member(X1,X2))).
% 0.12/0.37 cnf(i_0_15, plain, (X1=X2|~member(f1(X1,X2),X2)|~member(f1(X1,X2),X1))).
% 0.12/0.37 cnf(i_0_17, plain, (member(X1,complement(X2))|member(X1,X2)|~little_set(X1))).
% 0.12/0.37 cnf(i_0_14, plain, (X1=X2|member(f1(X1,X2),X1)|member(f1(X1,X2),X2))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 5 steps
% 0.12/0.37 cnf(i_0_22, negated_conjecture, (as!=cs), inference(start_rule)).
% 0.12/0.37 cnf(i_0_23, plain, (as!=cs), inference(extension_rule, [i_0_14])).
% 0.12/0.37 cnf(i_0_39, plain, (member(f1(as,cs),as)), inference(extension_rule, [i_0_12])).
% 0.12/0.37 cnf(i_0_40, plain, (member(f1(as,cs),cs)), inference(etableau_closure_rule, [i_0_40, ...])).
% 0.12/0.37 cnf(i_0_43, plain, (little_set(f1(as,cs))), inference(etableau_closure_rule, [i_0_43, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 3 tableaux to operate on
% 0.12/0.37 # Found closed tableau during pool population.
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------