TSTP Solution File: NUN134-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUN134-1 : TPTP v8.1.0. Released v8.1.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 : 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 : Mon Jul 18 16:26:26 EDT 2022
% Result : Unsatisfiable 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUN134-1 : TPTP v8.1.0. Released v8.1.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 2 04:30:06 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.38 # No SInE strategy applied
% 0.15/0.38 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.15/0.38 # and selection function SelectNewComplexAHP.
% 0.15/0.38 #
% 0.15/0.38 # Presaturation interreduction done
% 0.15/0.38 # Number of axioms: 15 Number of unprocessed: 15
% 0.15/0.38 # Tableaux proof search.
% 0.15/0.38 # APR header successfully linked.
% 0.15/0.38 # Hello from C++
% 0.15/0.38 # The folding up rule is enabled...
% 0.15/0.38 # Local unification is enabled...
% 0.15/0.38 # Any saturation attempts will use folding labels...
% 0.15/0.38 # 15 beginning clauses after preprocessing and clausification
% 0.15/0.38 # Creating start rules for all 1 conjectures.
% 0.15/0.38 # There are 1 start rule candidates:
% 0.15/0.38 # Found 15 unit axioms.
% 0.15/0.38 # 1 start rule tableaux created.
% 0.15/0.38 # 0 extension rule candidate clauses
% 0.15/0.38 # 15 unit axiom clauses
% 0.15/0.38
% 0.15/0.38 # Requested 8, 32 cores available to the main process.
% 0.15/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.15/0.38 # Creating equality axioms
% 0.15/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.15/0.38 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.38 # We now have 23 tableaux to operate on
% 0.15/0.40 # There were 1 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 1 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 1 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_27, plain, (sum(zero)=zero)).
% 0.15/0.40 cnf(i_0_21, plain, (times(X1,zero)=zero)).
% 0.15/0.40 cnf(i_0_20, plain, ('+'(X1,zero)=X1)).
% 0.15/0.40 cnf(i_0_22, plain, (times(X1,one)=X1)).
% 0.15/0.40 cnf(i_0_25, plain, (s('+'(X1,X2))='+'(s(X1),X2))).
% 0.15/0.40 cnf(i_0_29, plain, (times(a,s(a))='+'(sum(a),sum(a)))).
% 0.15/0.40 cnf(i_0_28, plain, ('+'(sum(X1),s(X1))=sum(s(X1)))).
% 0.15/0.40 cnf(i_0_26, plain, ('+'(X1,times(X2,X1))=times(s(X2),X1))).
% 0.15/0.40 cnf(i_0_17, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
% 0.15/0.40 cnf(i_0_19, plain, (times(times(X1,X2),X3)=times(X1,times(X2,X3)))).
% 0.15/0.40 cnf(i_0_23, plain, ('+'(times(X1,X2),times(X1,X3))=times(X1,'+'(X2,X3)))).
% 0.15/0.40 cnf(i_0_24, plain, ('+'(times(X1,X2),times(X3,X2))=times('+'(X1,X3),X2))).
% 0.15/0.40 cnf(i_0_16, plain, ('+'(X1,X2)='+'(X2,X1))).
% 0.15/0.40 cnf(i_0_18, plain, (times(X1,X2)=times(X2,X1))).
% 0.15/0.40 cnf(i_0_30, negated_conjecture, (times(s(a),s(s(a)))!='+'(sum(s(a)),sum(s(a))))).
% 0.15/0.40 cnf(i_0_32, plain, (X4=X4)).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 6 steps
% 0.15/0.40 cnf(i_0_27, plain, (sum(zero)=zero), inference(start_rule)).
% 0.15/0.40 cnf(i_0_40, plain, (sum(zero)=zero), inference(extension_rule, [i_0_35])).
% 0.15/0.40 cnf(i_0_62, plain, (sum(zero)!=zero), inference(closure_rule, [i_0_27])).
% 0.15/0.40 cnf(i_0_60, plain, (sum(zero)=sum(zero)), inference(extension_rule, [i_0_36])).
% 0.15/0.40 cnf(i_0_143, plain, (sum(zero)!=zero), inference(closure_rule, [i_0_27])).
% 0.15/0.40 cnf(i_0_141, plain, ('+'(sum(zero),sum(zero))='+'(sum(zero),zero)), inference(etableau_closure_rule, [i_0_141, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # Child (12321) has found a proof.
% 0.15/0.40
% 0.15/0.40 # Proof search is over...
% 0.15/0.40 # Freeing feature tree
%------------------------------------------------------------------------------